Increasing subsequences and the classical groups.
Rains, E.M. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Truncations of random unitary matrices and Young tableaux.”
Increasing subsequences and the classical groups.
Random matrices, magic squares and matching polynomials.
Diaconis, Persi, Gamburd, Alex (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jack deformations of Plancherel measures and traceless Gaussian random matrices.
Matsumoto, Sho (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wigner theorems for random matrices with dependent entries: ensembles associated to symmetric spaces and sample covariance matrices.
Hofmann-Credner, Katrin, Stolz, Michael (2008)
Electronic Communications in Probability [electronic only]
Similarity:
Jucys-Murphy elements and the unitary Weingarten function
Jonathan I. Novak (2010)
Banach Center Publications
Similarity:
We describe an approach to the unitary Weingarten function based on the JM elements of symmetric group algebras. When combined with previously known properties of the Weingarten function, this gives a surprising connection with the Moebius function of the lattice of noncrossing partitions.
Longest increasing subsequences of random colored permutations.
Borodin, Alexei (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Moments of characteristic polynomials enumerate two-rowed lexicographic arrays.
Strahov, E. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutations without long decreasing subsequences and random matrices.
Śniady, Piotr (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Eigenvalues of random wreath products.
Evans, Steven N. (2002)
Electronic Journal of Probability [electronic only]
Similarity:
The distribution of eigenvalues of randomized permutation matrices
Joseph Najnudel, Ashkan Nikeghbali (2013)
Annales de l’institut Fourier
Similarity:
In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter ) by replacing the entries equal to one by more general non-vanishing complex random variables. For these ensembles, in contrast with more classical models as the Gaussian Unitary Ensemble, or the Circular Unitary Ensemble, the eigenvalues can be very explicitly computed by using the cycle structure...
The spectral laws of Hermitian block-matrices with large random blocks.
Oraby, Tamer F. (2007)
Electronic Communications in Probability [electronic only]
Similarity:
Unitary completions of complex symmetric and skew symmetric matrices.
Tam, Tin-Yau, Yan, Wen (2007)
Applied Mathematics E-Notes [electronic only]
Similarity:
A scalarization technique for computing the power and exponential moments of Gaussian random matrices.
Vladimirov, Igor, Thompson, Bevan (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Orthogonal polynomial ensembles in probability theory.
König, Wolfgang (2005)
Probability Surveys [electronic only]
Similarity:
The random paving property for uniformly bounded matrices
Joel A. Tropp (2008)
Studia Mathematica
Similarity:
This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison-Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in comparison with its dimension can be paved by a partition of constant size. That is, the coordinates can be partitioned into a constant number of blocks so that the restriction of the matrix to each block of coordinates has norm less than one half. The original...