Results 1  10
of
72
Discrete orthogonal polynomial ensembles and the Plancherel measure
, 2001
"... We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of as probability measures on partitions. The Meixner ensemble i ..."
Abstract

Cited by 194 (10 self)
 Add to MetaCart
(Show Context)
We consider discrete orthogonal polynomial ensembles which are discrete analogues of the orthogonal polynomial ensembles in random matrix theory. These ensembles occur in certain problems in combinatorial probability and can be thought of as probability measures on partitions. The Meixner ensemble is related to a twodimensional directed growth model, and the Charlier ensemble is related to the lengths of weakly increasing subsequences in random words. The Krawtchouk ensemble occurs in connection with zigzag paths in random domino tilings of the Aztec diamond, and also in a certain simplified directed firstpassage percolation model. We use the Charlier ensemble to investigate the asymptotics of weakly increasing subsequences in random words and to prove a conjecture of Tracy and Widom. As a limit of the Meixner ensemble or the Charlier ensemble we obtain the Plancherel measure on partitions, and using this we prove a conjecture of Baik, Deift and Johansson that under the Plancherel measure, the distribution of the lengths of the first k rows in the partition, appropriately scaled, converges to the asymptotic joint distribution for the k largest eigenvalues of a random matrix from the Gaussian Unitary Ensemble. In this problem a certain discrete kernel, which we call the discrete Bessel kernel, plays an important role.
Asymptotics of Plancherel measures for symmetric groups
 J. Amer. Math. Soc
, 2000
"... 1.1. Plancherel measures. Given a finite group G, by the corresponding Plancherel measure we mean the probability measure on the set G ∧ of irreducible representations of G which assigns to a representation π ∈ G ∧ the weight (dim π) 2 /G. For the symmetric group S(n), the set S(n) ∧ is the set o ..."
Abstract

Cited by 182 (43 self)
 Add to MetaCart
(Show Context)
1.1. Plancherel measures. Given a finite group G, by the corresponding Plancherel measure we mean the probability measure on the set G ∧ of irreducible representations of G which assigns to a representation π ∈ G ∧ the weight (dim π) 2 /G. For the symmetric group S(n), the set S(n) ∧ is the set of partitions λ of the number
An introduction to harmonic analysis on the infinite symmetric group
, 2008
"... ..."
(Show Context)
Infinite wedge and random partitions
 Selecta Mathematica (new series
"... The aim of this paper is to show that random partitions have a very natural and direct connection to various structures which are well known in integrable systems. This connection is arguably even more natural than, for example, ..."
Abstract

Cited by 96 (7 self)
 Add to MetaCart
(Show Context)
The aim of this paper is to show that random partitions have a very natural and direct connection to various structures which are well known in integrable systems. This connection is arguably even more natural than, for example,
Random matrices and random permutations
 Internat. Math. Res. Notices
, 2000
"... We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions λ of n, the rows λ1,λ2,λ3,... of λ behave, suitably scaled, like the 1st, 2nd, 3rd, and so on eigenvalues of a Gaussian random Hermitian matrix as n → ∞. Our proof is ..."
Abstract

Cited by 77 (7 self)
 Add to MetaCart
(Show Context)
We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions λ of n, the rows λ1,λ2,λ3,... of λ behave, suitably scaled, like the 1st, 2nd, 3rd, and so on eigenvalues of a Gaussian random Hermitian matrix as n → ∞. Our proof is based on an interplay between maps on surfaces and ramified coverings of the sphere. We also establish a connection of this problem with intersection theory on the moduli spaces of curves. 1
A Fredholm determinant formula for Toeplitz determinants
"... The purpose of this note is to explain how the results of [13] apply to a question raised by A. Its and, independently, P. Deift during the MSRI workshop ..."
Abstract

Cited by 76 (10 self)
 Add to MetaCart
(Show Context)
The purpose of this note is to explain how the results of [13] apply to a question raised by A. Its and, independently, P. Deift during the MSRI workshop
Averages of characteristic polynomials in Random Matrix Theory
, 2004
"... We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the bulk scaling asymptotic limits are found for ensembles with G ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
(Show Context)
We compute averages of products and ratios of characteristic polynomials associated with Orthogonal, Unitary, and Symplectic Ensembles of Random Matrix Theory. The pfaffian/determinantal formulas for these averages are obtained, and the bulk scaling asymptotic limits are found for ensembles with Gaussian weights. Classical results for the correlation functions of the random matrix ensembles and their bulk scaling limits are deduced from these formulas by a simple computation. We employ a discrete approximation method: the problem is solved for discrete analogues of random matrix ensembles originating from representation theory, and then a limit transition is performed. Exact pfaffian/determinantal formulas for the discrete averages are proved using standard tools of linear algebra; no application of orthogonal or skeworthogonal polynomials is needed.
Determinantal probability measures
, 2002
"... Abstract. Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We initiate a detailed study of the discrete analogue, the most prominent example of which has been the uniform spanning tree measure. Our main results concern relationship ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
Abstract. Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We initiate a detailed study of the discrete analogue, the most prominent example of which has been the uniform spanning tree measure. Our main results concern relationships with matroids, stochastic domination, negative association, completeness for infinite matroids, tail triviality, and a method for extension of results from orthogonal projections to positive contractions. We also present several new avenues for further investigation, involving Hilbert spaces, combinatorics, homology,
Markov processes on partitions
, 2004
"... Abstract. We introduce and study a family of Markov processes on partitions. The processes preserve the socalled zmeasures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the dynamical correlation functions of these processes have ..."
Abstract

Cited by 24 (16 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce and study a family of Markov processes on partitions. The processes preserve the socalled zmeasures on partitions previously studied in connection with harmonic analysis on the infinite symmetric group. We show that the dynamical correlation functions of these processes have determinantal structure and we explicitly compute their correlation kernels. We also compute the scaling limits of the kernels in two different regimes. The limit kernels describe the asymptotic behavior of large rows and columns of the corresponding random Young diagrams, and the behavior of the Young diagrams near the diagonal. Our results show that recently discovered analogy between random partitions arising in representation theory and spectra of random matrices extends to the associated time–dependent models.