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

Gregory A. Freiman*, Boris L. Granovsky

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 is the threshold for the limiting distribution of the largest cluster. As a byproduct of our study, we prove the independence of the numbers of groups of fixed sizes, as n → ∞. 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.

Original languageEnglish
Pages (from-to)2483-2507
Number of pages25
JournalTransactions of the American Mathematical Society
Volume357
Issue number6
DOIs
StatePublished - Jun 2005

Keywords

  • Additive number systems
  • Coagulation-fragmentation process
  • Distributions on the set of partitions
  • Local limit theorem
  • Random combinatorial structures

Fingerprint

Dive into the research topics of 'Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws'. Together they form a unique fingerprint.

Cite this