Periodic Pólya Urns, the Density Method, and Asymptotics of Young Tableaux
arXiv:1912.01035
Abstract
Pólya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of the time (). We extend the work of Flajolet et al. on Pólya urns: the generating function encoding the evolution of the urn is studied by methods of analytic combinatorics. We show that the initial partial differential equations lead to ordinary linear differential equations which are related to hypergeometric functions (giving the exact state of the urns at time n). When the time goes to infinity, we prove that these periodic Pólya urns have asymptotic fluctuations which are described by a product of generalized gamma distributions. With the additional help of what we call the density method (a method which offers access to enumeration and random generation of poset structures), we prove that the law of the south-east corner of a triangular Young tableau follows asymptotically a product of generalized gamma distributions. This allows us to tackle some questions related to the continuous limit of large random Young tableaux and links with random surfaces.
arXiv comment56 pages, 11 figures, accepted in the Annals of Probability
References in corpus (9)
- Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas
- Analytic urns
- Random Sorting Networks
- The MAPLE package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
- Analysis of some exactly solvable diminishing urn models
- Arctic circles, domino tilings and square Young tableaux
- Random sorting networks: local statistics via random matrix laws
- A half-normal distribution scheme for generating functions
- Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology