Reversible coagulation-fragmentation processes and random combinatorial structures:asymptotics for the number of groups
classification
🧮 math.PR
math.CO
keywords
coagulation-fragmentationcombinatorialgroupsnumberrandomstructuresasymptoticscentral
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.