arXiv Analytics

Sign in

arXiv:math/0212170 [math.PR]AbstractReferencesReviewsResources

Reversible coagulation-fragmentation processes and random combinatorial structures:asymptotics for the number of groups

Michael Erlihson, Boris Granovsky

Published 2002-12-12, updated 2004-03-08Version 3

We establish the central limit theorem for the number of groups at the equilibrium of a coagulation-fragmentation process given by a parameter function with polynomial rate of growth. The result obtained is compared with the one for random combinatorial structures obeying the logarithmic condition.

Comments: This version will be published in the joutnal " Random structures and Algorithms"
Categories: math.PR, math.CO
Subjects: 60J27, 60K35, 82C22, 82C26
Related articles: Most relevant | Search more
arXiv:math/0105111 [math.PR] (Published 2001-05-13)
Asymptotics of certain coagulation-fragmentation processes and invariant Poisson-Dirichlet measures
arXiv:1612.06835 [math.PR] (Published 2016-12-20)
Box constrained $\ell_1$ optimization in random linear systems -- asymptotics
arXiv:1101.2682 [math.PR] (Published 2011-01-13, updated 2011-03-23)
Formulas and Asymptotics for the Asymmetric Simple Exclusion Process

Links

Toolbox