Limits of logarithmic combinatorial structures.

From MaRDI portal
Publication:1872161

DOI10.1214/aop/1019160500zbMath1044.60003OpenAlexW1965155608MaRDI QIDQ1872161

Simon Tavaré, Richard Arratia, Andrew David Barbour

Publication date: 6 May 2003

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

Full work available at URL: https://doi.org/10.1214/aop/1019160500



Related Items

Limits of logarithmic combinatorial structures., Power laws for family sizes in a duplication model, The distribution of rare alleles, Ewens Sampling and Invariable Generation, Unnamed Item, Strong convergence on weakly logarithmic combinatorial assemblies, Classical and almost sure local limit theorems, A product of invariant random permutations has the same small cycle structure as uniform, Unnamed Item, Oscillations for order statistics of some discrete processes, On strong and almost sure local limit theorems for a probabilistic model of the Dickman distribution, On Poisson approximations for the Ewens sampling formula when the mutation parameter grows with the sample size, Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof, Competition between discrete random variables, with applications to occupancy problems, Total variation approximation for random assemblies and a functional limit theorem, Almost sure local limit theorem for the Dickman distribution, Simulating the component counts of combinatorial structures, A random mapping with preferential attachment, The ubiquitous Ewens sampling formula, An analogue of Feller's theorem for logarithmic combinatorial assemblies, Число разложений случайной подстановки в композицию двух инволюций с заданным циклом в одном из сомножителей, Poisson-Dirichlet distribution with small mutation rate, Universality for random surfaces in unconstrained genus, The characteristic polynomial of a random matrix



Cites Work