Periodic Pólya urns, the density method and asymptotics of Young tableaux
DOI10.1214/19-AOP1411zbMath1453.60010arXiv1912.01035MaRDI QIDQ782409
Michael Wallner, Philippe Marchal, Cyril Banderier
Publication date: 27 July 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.01035
generating functionshypergeometric functionYoung tableaugeneralized gamma distributionanalytic combinatoricsPólya urnD-finite functionMittag-Leffler distributionpumping moment
Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Special processes (60K99) Combinatorial probability (60C05)
Related Items (3)
Uses Software
Cites Work
- The cusp-Airy process
- Arctic circles, domino tilings and square Young tableaux
- Asymptotics of uniformly random lozenge tilings of polygons. Gaussian free field
- Combinatorial families of multilabelled increasing trees and hook-length formulas
- Enumeration formulas for Young tableaux in a diagonal strip
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- G distributions and the beta-gamma algebra
- Dimers on rail yard graphs
- Generalized gamma approximation with rates for urns, walks and trees
- Limit theorems for triangular urn schemes
- Smoothing equations for large Pólya urns
- Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
- Moments of gamma type and the Brownian supremum process area
- Two poset polytopes
- A variational problem for random Young tableaux
- Representations of symmetric groups and free probability
- Transition probabilities for continual Young diagrams and the Markov moment problem
- The distributions of the entries of Young tableaux
- An equivalence theorem for regular differential chains
- Analytic urns
- On subordinators, self-similar Markov processes and some factorizations of the exponential variable
- Dominos and the Gaussian free field.
- Explicit formulas for hook walks on continual Young diagrams
- A half-normal distribution scheme for generating functions
- Another probabilistic method in the theory of Young tableaux
- Random sorting networks: local statistics via random matrix laws
- Hook formulas for skew shapes. III: Multivariate and product formulas
- Fourier transform on high-dimensional unitary groups with applications to random tilings
- Two-color balanced affine urn models with multiple drawings
- Random sorting networks
- Eigenvalues of GUE minors
- A line-breaking construction of the stable trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Limit shapes for random square Young tableaux
- Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
- The Surprising Mathematics of Longest Increasing Subsequences
- Robinson--Schensted--Knuth Algorithm, Jeu de Taquin, and Kerov--Vershik Measures on Infinite Tableaux
- Propriétés locales des fonctions à séries de Fourier aléatoires
- Polya Urn Models
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data Structures
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- GFUN
- On the Sums ∑ k = -∞ ∞ (4k + 1) -n
- A Proof of the Generalized Second-Limit Theorem in the Theory of Probability
- Asymptotic degree distribution in random recursive trees
- 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
- Rectangular Young tableaux and the Jacobi ensemble
- From Aztec diamonds to pyramids: Steep tilings
- Formulae and Asymptotics for Coefficients of Algebraic Functions
- Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
- A Generalization of the Gamma Distribution
- New hook length formulas for binary trees
- On random shifted standard Young tableaux and 132-avoiding sorting networks
- Hook length formula and geometric combinatorics
- The Maple package TDDS for computing Thomas decompositions of systems of nonlinear PDEs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Periodic Pólya urns, the density method and asymptotics of Young tableaux