The structure of typical clusters in large sparse random configurations

DOI10.1007/S10955-009-9728-YzbMATH Open1168.82028arXiv0811.2988OpenAlexW2079468919MaRDI QIDQ2391040FDOQ2391040

Authors: Jean Bertoin, Vladas Sidoravicius 

Publication date: 24 July 2009

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

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.

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

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

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)

Cites Work

• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• The phase transition in inhomogeneous random graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Random graph dynamics
• Random Fragmentation and Coagulation Processes
• Generating simple random graphs with prescribed degree distribution
• Distances in random graphs with finite mean and infinite variance degrees
• The asymptotic number of labeled graphs with given degree sequences
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Thek-Core and Branching Processes
• Universality for the distance in finite variance random graphs
• Distances in random graphs with finite variance degrees
• 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 total progeny in a branching process and a related random walk
• A new approach to the giant component problem
• Title not available (Why is that?)
• A system of grabbing particles related to Galton-Watson trees

Cited In (10)

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

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)