The Structure of Typical Clusters in Large Sparse Random Configurations

被引:8
作者
Bertoin, Jean [1 ,2 ]
Sidoravicius, Vladas [3 ,4 ]
机构
[1] UPMC, Probabil Lab, F-75013 Paris, France
[2] ENS, DMA, F-75230 Paris 05, France
[3] IMPA, Rio De Janeiro, Brazil
[4] CWI, NL-1090 GB Amsterdam, Netherlands
关键词
Configuration model; Galton-Watson tree; Smoluchowski coagulation equations; RANDOM GRAPHS; GIANT COMPONENT; COAGULATION;
D O I
10.1007/s10955-009-9728-y
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The initial purpose of this work is to provide a probabilistic explanation of recent results 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 az. The limit is given in terms of the distribution of a Galton-Watson process started with two ancestors.
引用
收藏
页码:87 / 105
页数:19
相关论文
共 24 条
[1]  
Aldous D, 1997, ANN PROBAB, V25, P812
[2]   Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists [J].
Aldous, DJ .
BERNOULLI, 1999, 5 (01) :3-48
[3]  
[Anonymous], 2006, Random fragmentation and coagulation processes
[4]   ASYMPTOTIC NUMBER OF LABELED GRAPHS WITH GIVEN DEGREE SEQUENCES [J].
BENDER, EA ;
CANFIELD, ER .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1978, 24 (03) :296-307
[5]  
BERTOIN J, SYSTEM GRABBING PART
[6]  
BERTOIN J, 2009, ANAL NONLIN IN PRESS, DOI DOI 10.1016/J.ANIHPC.2008.10.007
[7]  
Bollobas B., 1980, Eur. J. Comb, V1, P311, DOI [10.1016/S0195-6698(80)80030-8, DOI 10.1016/S0195-6698(80)80030-8]
[8]   The phase transition in inhomogeneous random graphs [J].
Bollobas, Bela ;
Janson, Svante ;
Riordan, Oliver .
RANDOM STRUCTURES & ALGORITHMS, 2007, 31 (01) :3-122
[9]   Generating simple random graphs with prescribed degree distribution [J].
Britton, Tom ;
Deijfen, Maria ;
Martin-Loeff, Anders .
JOURNAL OF STATISTICAL PHYSICS, 2006, 124 (06) :1377-1397
[10]  
Durrett Richard, 2007, Random Graph Dynamics