Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions
Top Cited Papers
- 1 October 2024
- journal article
- research article
- Published by Institute of Mathematical Statistics in The Annals of Applied Probability
- Vol. 34 (5) , 4635-4693
Abstract
Multitudinous probabilistic and combinatorial objects are associated with generating functions satisfying a composition scheme F(z)=G(H(z)). The analysis becomes challenging when this scheme is critical (i.e., G and H are simultaneously singular). Motivated by many examples (random mappings, planar maps, directed lattice paths), we consider a natural extension of this scheme, namely F(z,u)=G(uH(z))M(z). We also consider a variant of this scheme, which allows us to analyse the number of H-components of a given size in F. We prove that these two models lead to a rich world of limit laws, where we identify the key role played by a new universal law introduced in this article: the three-parameter Mittag-Leffler distribution, which is essentially the product of a beta and a Mittag-Leffler distribution. We also prove (double) phase transitions, additionally involving Boltzmann and mixed Poisson distributions, bringing a unified explanation of the associated thresholds. In all cases we obtain moment convergence and local limit theorems. We end with extensions of the critical composition scheme to a cycle scheme and to the multivariate case, leading to product distributions. Applications are presented for random walks, trees (supertrees of trees, increasingly labelled trees, preferential attachment trees), triangular Pólya urns, and the Chinese restaurant process.Keywords
All Related Versions
This publication has 111 references indexed in Scilit:
- Ancestors and descendants in evolving k‐tree modelsRandom Structures & Algorithms, 2012
- Graph classes with given 3‐connected components: Asymptotic enumeration and random graphsRandom Structures & Algorithms, 2012
- Analysis of three graph parameters for random treesRandom Structures & Algorithms, 2009
- Level of nodes in increasing trees revisitedRandom Structures & Algorithms, 2007
- Limit laws for embedded trees: Applications to the integrated superBrownian excursionRandom Structures & Algorithms, 2006
- Random cutting and records in deterministic and random treesRandom Structures & Algorithms, 2005
- Asymptotic degree distribution in random recursive treesRandom Structures & Algorithms, 2004
- Random maps, coalescing saddles, singularity analysis, and Airy phenomenaRandom Structures & Algorithms, 2001
- The birth of the giant componentRandom Structures & Algorithms, 1993
- On the structure of random plane‐oriented recursive trees and their branchesRandom Structures & Algorithms, 1993