Convergence of Achlioptas Processes via Differential Equations with Unique Solutions

In Achlioptas processes, starting from an empty graph, in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. The evolution of the rescaled size of the largest component in such variations of the Erdős–Renyi random graph process has recently received considerable attention, in particular for Bollobas's ‘product rule’. In this paper we establish the following result for rules such as the product rule: the limit of the rescaled size of the ‘giant’ component exists and is continuous provided that a certain system of differential equations has a unique solution. In fact, our result applies to a very large class of Achlioptas-like processes. Our proof relies on a general idea which relates the evolution of stochastic processes to an associated system of differential equations. Provided that the latter has a unique solution, our approach shows that certain discrete quantities converge (after appropriate rescaling) to this solution.

[1]  B. Bollobás The evolution of random graphs , 1984 .

[2]  J. Norris,et al.  Smoluchowski's coagulation equation: uniqueness, non-uniqueness and a hydrodynamic limit for the stochastic coalescent , 1998, math/9801145.

[3]  Oliver Riordan,et al.  Achlioptas processes are not always self-averaging. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  S N Dorogovtsev,et al.  Explosive percolation transition is actually continuous. , 2010, Physical review letters.

[6]  Svante Janson,et al.  Phase transitions for modified Erdős–Rényi processes , 2010, 1005.4494.

[7]  Xuan Wang,et al.  Bounded-Size Rules: The Barely Subcritical Regime , 2014, Comb. Probab. Comput..

[8]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Alan M. Frieze,et al.  Avoiding a giant component , 2001, Random Struct. Algorithms.

[10]  T. G. Seierstad A central limit theorem via differential equations , 2009, 0906.4202.

[11]  Svante Janson Networking—Smoothly Does It , 2011, Science.

[12]  Oliver Riordan,et al.  Explosive Percolation Is Continuous , 2011, Science.

[13]  D. Aldous Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists , 1999 .

[14]  N. Wormald The differential equation method for random graph processes and greedy algorithms , 1999 .

[15]  Amarjit Budhiraja,et al.  Bohman-Frieze processes at criticality and emergence of the giant component , 2011 .

[16]  J. Spencer,et al.  Explosive Percolation in Random Networks , 2009, Science.

[17]  Oliver Riordan,et al.  The evolution of subcritical Achlioptas processes , 2012, Random Struct. Algorithms.

[18]  Michael Mitzenmacher,et al.  Local cluster aggregation models of explosive percolation. , 2010, Physical review letters.

[19]  Xuan Wang,et al.  Aggregation models with limited choice and the multiplicative coalescent , 2015, Random Struct. Algorithms.

[20]  Eric J Friedman,et al.  Construction and analysis of random networks with explosive percolation. , 2009, Physical review letters.

[21]  O. Riordan,et al.  Achlioptas process phase transitions are continuous , 2011, 1102.5306.

[22]  Finite-size scaling theory for explosive percolation transitions. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Witold Hurewicz,et al.  Lectures on Ordinary Differential Equations , 1959 .

[24]  Tom Bohman,et al.  Creating a Giant Component , 2006, Comb. Probab. Comput..

[25]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[26]  Santo Fortunato,et al.  Explosive percolation: a numerical analysis. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[28]  N. Wormald Differential Equations for Random Processes and Random Graphs , 1995 .

[29]  Joel H. Spencer,et al.  Birth control for giants , 2007, Comb..

[30]  Joel H. Spencer,et al.  The Bohman‐Frieze process near criticality , 2011, Random Struct. Algorithms.

[31]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[32]  A. Gut Probability: A Graduate Course , 2005 .

[33]  B. Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007 .

[34]  Béla Bollobás,et al.  Random Graphs and Branching Processes , 2008 .

[35]  Robert M Ziff,et al.  Explosive growth in biased dynamic percolation on two-dimensional regular lattice networks. , 2009, Physical review letters.