Reversible coagulation–fragmentation processes and random combinatorial structures: Asymptotics for the number of groups

Michael Erlihson, Boris L. Granovsky

Random Structures and Algorithms · 2004 · 17 citations · 14 references

Concepts

Abstract

Abstract The equilibrium distribution of a reversible coagulation‐fragmentation process (CFP) and the joint distribution of components of a random combinatorial structure (RCS) are given by the same probability measure on the set of partitions. We establish a central limit theorem for the number of groups (= components) in the case a ( k ) = qk p −1 , k ≥ 1, q , p > 0, where a ( k ), k ≥ 1, is the parameter function that induces the invariant measure. The result obtained is compared with the ones for logarithmic RCS's and for RCS's, corresponding to the case p < 0. © 2004 Wiley Periodicals, Inc. Random Struct. Alg. 2004

References

14