Random combinatorial structures: the convergent case

DOI10.1016/J.JCTA.2004.09.001zbMath1065.60143arXivmath/0305031OpenAlexW2128252302MaRDI QIDQ1770433

Boris L. Granovsky, Andrew David Barbour

Publication date: 6 April 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial structuresgiant componentcoagulation-fragmentationconditioning relation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (13)

Gibbs distributions for random partitions generated by a fragmentation process ⋮ On Statistics of Permutations Chosen From the Ewens Distribution ⋮ Graphon convergence of random cographs ⋮ Limit distributions for Euclidean random permutations ⋮ Limits of random tree-like discrete structures ⋮ Asymptotic enumeration and limit laws for multisets: the subexponential case ⋮ Ergodicity of multiplicative statistics ⋮ Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof ⋮ Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case ⋮ On time dynamics of coagulation-fragmentation processes ⋮ Unlabelled Gibbs partitions ⋮ Cycle length distributions in random permutations with diverging cycle weights ⋮ Cycle structure of random permutations with cycle weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic formula for a partition function of reversible coagulation-fragmentation processes
• Compound Poisson approximation for nonnegative random variables via Stein's method
• The equilibrium behavior of reversible coagulation-fragmentation processes
• Random set partitions: Asymptotics of subset counts
• Logarithmic combinatorial structures: A probabilistic approach
• Asymptotics for the probability of connectedness and the distribution of number of components
• The number of trees
• Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws
• The largest tree in certain models of random forests

This page was built for publication: Random combinatorial structures: the convergent case