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

2002/12/12 by Michael Erlihson, Erlihson, Michael, Boris Granovsky +1
Mathematics · #60J27 #60K35 #82C22 #82C26 #Combinatorics (math.CO) #FOS: Mathematics #Probability (math.PR) #math.CO #math.PR #msc:60J27 #msc:60K35 #msc:82C22 #msc:82C26

paper · pdf · doi:10.48550/arxiv.math/0212170

This version will be published in the joutnal " Random structures and Algorithms"

arxiv created 2004/03/08 · arxiv updated 2009/11/30

Abstract

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.

Related

• Asymptotic formula for a partition function of reversible coagulation -fragmentation processes
• Limit shapes of multiplicative measures associated with coagulation-fragmentation processes and random combinatorial structures
• The coagulation-fragmentation hierarchy with homogeneous rates and underlying stochastic dynamics
• Asymptotics of counts of small components in random structures and models of coagulation-fragmentation
• On time dynamics of coagulation-fragmentation processes