The structure of typical clusters in large sparse random configurations

Abstract

The initial purpose of this work is to provide a probabilistic explanation of a recent result on a version of Smoluchowski's coagulation equations in which the number of aggregations is limited. The latter models the deterministic evolution of concentrations of particles in a medium where particles coalesce pairwise as time passes and each particle can only perform a given number of aggregations. Under appropriate assumptions, the concentrations of particles converge as time tends to infinity to some measure which bears a striking resemblance with the distribution of the total population of a Galton-Watson process started from two ancestors. Roughly speaking, the configuration model is a stochastic construction which aims at producing a typical graph on a set of vertices with pre-described degrees. Specifically, one attaches to each vertex a certain number of stubs, and then join pairwise the stubs uniformly at random to create edges between vertices. In this work, we use the configuration model as the stochastic counterpart of Smoluchowski's coagulation equations with limited aggregations. We establish a hydrodynamical type limit theorem for the empirical measure of the shapes of clusters in the configuration model when the number of vertices tends to $\infty$. The limit is given in terms of the distribution of a Galton-Watson process started with two ancestors.

References in corpus (9)

• The structure and function of complex networks
• Random graphs with arbitrary degree distributions and their applications
• The phase transition in inhomogeneous random graphs
• Generating simple random graphs with prescribed degree distribution
• Distances in random graphs with finite variance degrees
• The k-core and branching processes
• Spinal partitions and invariance under re-rooting of continuum random trees
• Smoluchowski's coagulation equation: uniqueness, non-uniqueness and a hydrodynamic limit for the stochastic coalescent
• Two solvable systems of coagulation equations with limited aggregations

Cited by in corpus (6)

• First passage percolation on random graphs with finite mean degrees
• On Bootstrap Percolation in Living Neural Networks
• Analytical results on the polymerisation random graph model
• Uniqueness of post-gelation solutions of a class of coagulation equations
• Self-organized criticality in a discrete model for Smoluchowski's equation with limited aggregations
• A model for coagulation with mating