The structure of typical clusters in large sparse random configurations

DOI10.1007/S10955-009-9728-YMaRDI QIDQ2391040zbMATHOpenAlexFDO

Authors Jean Bertoin, Vladas Sidoravicius

Publication date 24 July 2009

Published in Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0811.2988

zbMATH Keywords

configuration modelGalton-Watson treeSmoluchowski coagulation equations

Mathematics Subject Classification ID

Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Statistical mechanics of polymers (82D60)

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.

Recommendations

• Coagulation with limited aggregations
• Stochastic coalescence
• The central limit theorem for the Smoluchovski coagulation model
• Clustering in coagulation-fragmentation processes, random combinatorial structures and additive number systems: Asymptotic formulae and limiting laws
• Cluster coagulation

Cites work

• scientific article; zbMATH DE number 3600068 (Why is no real title available?)
• A critical point for random graphs with a given degree sequence
• A new approach to the giant component problem
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• A system of grabbing particles related to Galton-Watson trees
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Distances in random graphs with finite mean and infinite variance degrees
• Distances in random graphs with finite variance degrees
• Generating simple random graphs with prescribed degree distribution
• Random Fragmentation and Coagulation Processes
• Random graph dynamics
• Smoluchowski's coagulation equation: Uniqueness, nonuniqueness and a hydrodynamic limit for the stochastic coalescent
• Spinal partitions and invariance under re-rooting of continuum random trees
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• The asymptotic number of labeled graphs with given degree sequences
• The phase transition in inhomogeneous random graphs
• The total progeny in a branching process and a related random walk
• Thek-Core and Branching Processes
• Universality for the distance in finite variance random graphs

Cited in

(9)

• A system of grabbing particles related to Galton-Watson trees
• Analytic results on the polymerisation random graph model
• A model for coagulation with mating
• Two solvable systems of coagulation equations with limited aggregations
• First passage percolation on random graphs with finite mean degrees
• From cluster ensemble to structure ensemble
• Bootstrap percolation in living neural networks
• Uniqueness of post-gelation solutions of a class of coagulation equations
• The component sizes of a critical random graph with given degree sequence

This page was built for publication: The structure of typical clusters in large sparse random configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391040)