Percolation on dense graph sequences.

In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs (G n ). Let λn be the largest eigenvalue of the adjacency matrix of G n , and let G n (p n ) be the random subgraph of G n obtained by keeping each edge independently with probability p n . We show that the appearance of a giant component in G n (p n ) has a sharp threshold at p n = 1/λ n . In fact, we prove much more: if (G n ) converges to an irreducible limit, then the density of the largest component of G n (c/n) tends to the survival probability of a multi-type branching process defined in terms of this limit. Here the notions of convergence and limit are those of Borgs, Chayes, Lovasz, S6s and Vesztergombi. In addition to using basic properties of convergence, we make heavy use of the methods of Bollobas, Janson and Riordan, who used multi-type branching processes to study the emergence of a giant component in a very broad family of sparse inhomogeneous random graphs.

[1]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[2]  János Komlós,et al.  Largest random component of ak-cube , 1982, Comb..

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

[4]  H. Kesten,et al.  Inequalities with applications to percolation and reliability , 1985 .

[5]  Tomasz Łuczak.  Component behavior near the critical point of the random graph process , 1990 .

[6]  Tomasz Luczak,et al.  Component Behavior Near the Critical Point of the Random Graph Process , 1990, Random Struct. Algorithms.

[7]  Yoshiharu Kohayakawa,et al.  The Evaluation of Random Subgraphs of the Cube , 1992, Random Struct. Algorithms.

[8]  Christian Borgs,et al.  The Birth of the Infinite Cluster:¶Finite-Size Scaling in Percolation , 2001 .

[9]  David Reimer,et al.  Proof of the Van den Berg–Kesten Conjecture , 2000, Combinatorics, Probability and Computing.

[10]  I. Benjamini,et al.  Recurrence of Distributional Limits of Finite Planar Graphs , 2000, math/0011019.

[11]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[12]  Remco van der Hofstad,et al.  Random subgraphs of finite graphs: I. The scaling window under the triangle condition , 2003 .

[13]  Remco van der Hofstad,et al.  Random subgraphs of finite graphs : II. The lace expansion and the triangle condition , 2003 .

[14]  Alan M. Frieze,et al.  The emergence of a giant component in random subgraphs of pseudo‐random graphs , 2004, Random Struct. Algorithms.

[15]  Noga Alon,et al.  Percolation on finite graphs and isoperimetric inequalities , 2004 .

[16]  László Lovász,et al.  Limits of dense graph sequences , 2004, J. Comb. Theory B.

[17]  P. Valtr,et al.  Topics in Discrete Mathematics , 2006 .

[18]  V. Sós,et al.  Counting Graph Homomorphisms , 2006 .

[19]  Joel H. Spencer,et al.  Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube , 2006, Comb..

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

[21]  V. Sós,et al.  Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.

[22]  V. Sós,et al.  Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics , 2012 .