Results 1  10
of
45
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 140 (8 self)
 Add to MetaCart
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.
Nonintersecting paths, random tilings and random matrices
 Probab. Theory Related Fields
, 2002
"... Abstract. We investigate certain measures induced by families of nonintersecting paths in domino tilings of the Aztec diamond, rhombus tilings of an abchexagon, a dimer model on a cylindrical brick lattice and a growth model. The measures obtained, e.g. the Krawtchouk and Hahn ensembles, have the s ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
Abstract. We investigate certain measures induced by families of nonintersecting paths in domino tilings of the Aztec diamond, rhombus tilings of an abchexagon, a dimer model on a cylindrical brick lattice and a growth model. The measures obtained, e.g. the Krawtchouk and Hahn ensembles, have the same structure as the eigenvalue measures in random matrix theory like GUE, which can in fact can be obtained from nonintersecting Brownian motions. The derivations of the measures are based on the KarlinMcGregor or LindströmGesselViennot method. We use the measures to show some asymptotic results for the models. 1.
Mixing times of lozenge tiling and card shuffling Markov chains
, 1997
"... Abstract. We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, ..."
Abstract

Cited by 67 (1 self)
 Add to MetaCart
Abstract. We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, Randall, and Sinclair to generate random tilings of regions by lozenges. For an ℓ×ℓ region we bound the mixing time by O(ℓ 4 log ℓ), which improves on the previous bound of O(ℓ 7), and we show the new bound to be essentially tight. In another application we resolve a few questions raised by Diaconis and SaloffCoste by lower bounding the mixing time of various cardshuffling Markov chains. Our lower bounds are within a constant factor of their upper bounds. When we use our methods to modify a pathcoupling analysis of Bubley and Dyer, we obtain an O(n 3 log n) upper bound on the mixing time of the KarzanovKhachiyan Markov chain for linear extensions. 1.
A variational principle for domino tilings
"... Abstract. We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can be described by a function that maximizes an entrop ..."
Abstract

Cited by 62 (11 self)
 Add to MetaCart
Abstract. We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can be described by a function that maximizes an entropy integral. We associate an entropy to every sort of local behavior domino tilings can exhibit, and prove that almost all tilings lie within ε (for an appropriate metric) of the unique entropymaximizing solution. This gives a solution to the dimer problem with fully general boundary conditions, thereby resolving an issue first raised by Kasteleyn. Our methods also apply to dimer models on other grids and their associated tiling models, such as tilings of the plane by three orientations of unit lozenges. The effect of boundary conditions is, however, not entirely trivial and will be discussed in more detail in a subsequent paper. P. W. Kasteleyn, 1961 1.
The arctic circle boundary and the Airy process
 Ann. Prob
, 2005
"... Abstract. We prove that the, appropriately rescaled, boundary of the north polar region in the Aztec diamond converges to the Airy process. The proof uses certain determinantal point processes given by the extended Krawtchouk kernel. We also prove a version of Propp’s conjecture concerning the struc ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
Abstract. We prove that the, appropriately rescaled, boundary of the north polar region in the Aztec diamond converges to the Airy process. The proof uses certain determinantal point processes given by the extended Krawtchouk kernel. We also prove a version of Propp’s conjecture concerning the structure of the tiling at the center of the Aztec diamond. 1. Introduction and
Uniform Asymptotics for Polynomials Orthogonal With Respect to a General Class of Discrete Weights and Universality Results for Associated Ensembles: Announcement of Results
 INT. MATH. RES. NOT
, 2003
"... ..."
The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis
"... Abstract. We compute the number of rhombus tilings of a hexagon with sides N, M, N, N, M, N, which contain a fixed rhombus on the symmetry axis that cuts through the sides of length M. 1. ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
Abstract. We compute the number of rhombus tilings of a hexagon with sides N, M, N, N, M, N, which contain a fixed rhombus on the symmetry axis that cuts through the sides of length M. 1.
Universality for mathematical and physical systems
, 2006
"... Abstract. All physical systems in equilibrium obey the laws of thermodynamics. In other words, whatever the precise nature of the interaction between the atoms and molecules at the microscopic level, at the macroscopic level, physical systems exhibit universal behavior in the sense that they are all ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Abstract. All physical systems in equilibrium obey the laws of thermodynamics. In other words, whatever the precise nature of the interaction between the atoms and molecules at the microscopic level, at the macroscopic level, physical systems exhibit universal behavior in the sense that they are all governed by the same laws and formulae of thermodynamics. In this paper we describe some recent history of universality ideas in physics starting with Wigner’s model for the scattering of neutrons off large nuclei and show how these ideas have led mathematicians to investigate universal behavior for a variety of mathematical systems. This is true not only for systems which have a physical origin, but also for systems which arise in a purely mathematical context such as the Riemann hypothesis, and a version of the card game solitaire called patience sorting. 1.
Toeplitz determinants, random growth and determinantal processes
 In Proc. Internat. Cong. Mathematicians, vol. III (Beijing 2002), Higher Ed
, 2002
"... We summarize some of the recent developments which link certain problems in combinatorial theory related to random growth to random matrix theory. ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
We summarize some of the recent developments which link certain problems in combinatorial theory related to random growth to random matrix theory.
Generating Random Elements of Finite Distributive Lattices
 Electronic Journal of Combinatorics
, 1997
"... This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using "coupling from the past" to remove initialization bias from Monte ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using "coupling from the past" to remove initialization bias from Monte Carlo randomization.