Periodic Pólya urns, the density method and asymptotics of Young tableaux

DOI10.1214/19-AOP1411zbMATH Open1453.60010arXiv1912.01035MaRDI QIDQ782409FDOQ782409

Authors: Cyril Banderier, Philippe Marchal, Michael Wallner 

Publication date: 27 July 2020

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: P'olya 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 ($operatornamemodp$). We extend the work of Flajolet et al. on P'olya 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'olya 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.

Full work available at URL: https://arxiv.org/abs/1912.01035

Recommendations

• Periodic P\'olya urns and an application to Young tableaux
• Limit distributions for large Pólya urns
• Pólya urns via the contraction method
• Fully analyzing an algebraic Pólya urn model
• Analytic urns

zbMATH Keywords

hypergeometric functiongenerating functionsYoung tableaugeneralized gamma distributionanalytic combinatoricsD-finite functionMittag-Leffler distributionpumping momentPólya urn

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Special processes (60K99)

Cites Work

• GFUN
• NIST handbook of mathematical functions
• Title not available (Why is that?)
• A Generalization of the Gamma Distribution
• Analytic combinatorics
• Two poset polytopes
• Title not available (Why is that?)
• Dominos and the Gaussian free field.
• Eigenvalues of GUE minors
• Robinson-Schensted-Knuth algorithm, jeu de taquin, and Kerov-Vershik measures on infinite tableaux
• Asymptotics of uniformly random lozenge tilings of polygons. Gaussian free field
• Title not available (Why is that?)
• From Aztec diamonds to pyramids: Steep tilings
• Title not available (Why is that?)
• Dimers on rail yard graphs
• Representations of symmetric groups and free probability
• Transition probabilities for continual Young diagrams and the Markov moment problem
• Some exactly solvable models of urn process theory
• Title not available (Why is that?)
• G distributions and the beta-gamma algebra
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
• Asymptotic degree distribution in random recursive trees
• Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
• A variational problem for random Young tableaux
• Polya Urn Models
• Title not available (Why is that?)
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Rectangular Young tableaux and the Jacobi ensemble
• Analytic urns
• Propriétés locales des fonctions à séries de Fourier aléatoires
• The cusp-Airy process
• Limit theorems for triangular urn schemes
• Moments of gamma type and the Brownian supremum process area
• The surprising mathematics of longest increasing subsequences
• Generalized gamma approximation with rates for urns, walks and trees
• Limit shapes for random square Young tableaux
• Title not available (Why is that?)
• On subordinators, self-similar Markov processes and some factorizations of the exponential variable
• On the Sums ∑ k = -∞ ∞ (4k + 1) -n
• Random sorting networks: local statistics via random matrix laws
• Random sorting networks
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• Title not available (Why is that?)
• Another probabilistic method in the theory of Young tableaux
• Arctic circles, domino tilings and square Young tableaux
• Hook length formula and geometric combinatorics
• Enumeration formulas for Young tableaux in a diagonal strip
• Combinatorial families of multilabelled increasing trees and hook-length formulas
• A line-breaking construction of the stable trees
• Title not available (Why is that?)
• A Proof of the Generalized Second-Limit Theorem in the Theory of Probability
• Some properties of generalized gamma distribution
• Fourier transform on high-dimensional unitary groups with applications to random tilings
• The distributions of the entries of Young tableaux
• An equivalence theorem for regular differential chains
• Explicit formulas for hook walks on continual Young diagrams
• A half-normal distribution scheme for generating functions
• Hook formulas for skew shapes. III: Multivariate and product formulas
• Two-color balanced affine urn models with multiple drawings
• Title not available (Why is that?)
• Exactly solvable balanced tenable urns with random entries via the analytic methodology
• On martingale tail sums in affine two-color urn models with multiple drawings
• Multiple drawing multi-colour urns by stochastic approximation
• Periodic P\'olya urns and an application to Young tableaux
• Formulae and asymptotics for coefficients of algebraic functions
• New hook length formulas for binary trees
• On random shifted standard Young tableaux and 132-avoiding sorting networks
• The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
• Smoothing equations for large Pólya urns

Cited In (6)

• Geometry of weighted recursive and affine preferential attachment trees
• CFT correlators, \(\mathcal{W}\)-algebras and generalized Catalan numbers
• Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
• Rectangular Young tableaux with local decreases and the density method for uniform random generation
• Periodic P\'olya urns and an application to Young tableaux
• Young tableaux with periodic walls: counting with the density method

Uses Software

• Digital Library of Mathematical Functions
• gfun
• TDDS

This page was built for publication: Periodic Pólya urns, the density method and asymptotics of Young tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782409)