Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws

Abstract

We develop a unified approach to the problem of clustering in the three different fields of applications indicated in the title of the paper, in the case when the parametric function of the models is regularly varying with positive exponent. The approach is based on Khintchine’s probabilistic method that grew out of the Darwin-Fowler method in statistical physics. Our main result is the derivation of asymptotic formulae for the distribution of the largest and the smallest clusters (= components), as the total size of a structure (= number of particles) goes to infinity. We discover that n 1 l + 1 n^{\frac {1}{l+1}} is the threshold for the limiting distribution of the largest cluster. As a by-product of our study, we prove the independence of the numbers of groups of fixed sizes, as n → ∞ . n\to \infty . This is in accordance with the general principle of asymptotic independence of sites in mean-field models. The latter principle is commonly accepted in statistical physics, but not rigorously proved.