Random subgraphs of finite graphs : II. The lace expansion and the triangle condition

In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lace expansion to prove quite generally that, for finite graphs that are tori, the triangle condition for percolation is implied by a certain triangle condition for simple random walks on the graph. The latter is readily verified for several graphs with vertex set {0, 1, ..., r - 1} n , including the Hamming cube on an alphabet of r letters (the n-cube, for r = 2), the n-dimensional torus with nearest-neighbor bonds and n sufficiently large, and the n-dimensional torus with n > 6 and sufficiently spread-out (long range) bonds. The conclusions of our previous paper thus apply to the percolation phase transition for each of the above examples.

[1]  Remco van der Hofstad,et al.  Convergence of critical oriented percolation to super-Brownian motion above 4+1 dimensions , 2003 .

[2]  Thomas Spencer,et al.  Self-avoiding walk in 5 or more dimensions , 1985 .

[3]  Remco van der Hofstad,et al.  Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models , 2000, math-ph/0011046.

[4]  Gordon Slade,et al.  The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions , 1995, Combinatorics, Probability and Computing.

[5]  M. Aizenman,et al.  Sharpness of the phase transition in percolation models , 1987 .

[6]  N. Madras,et al.  THE SELF-AVOIDING WALK , 2006 .

[7]  Gordon Slade,et al.  A generalised inductive approach to the lace expansion , 2000 .

[8]  H. Poincaré,et al.  Percolation ? , 1982 .

[9]  Gordon Slade.  Lattice Trees, Percolation and Super-Brownian Motion , 1999 .

[10]  Remco van der Hofstad,et al.  Asymptotic expansions in n−1 for percolation critical values on the n‐Cube and ℤn , 2005, Random Struct. Algorithms.

[11]  Michael Aizenman,et al.  On the Number of Incipient Spanning Clusters , 1997 .

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  B. Nguyen.  Gap exponents for percolation processes with triangle condition , 1987 .

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

[15]  Gordon Slade.  The diffusion of self-avoiding random walk in high dimensions , 1987 .

[16]  Gordon Slade,et al.  The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion , 2000 .

[17]  Christian Borgs,et al.  Random subgraphs of finite graphs. Part III: The phase transition for the n-cube , 2003 .

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

[19]  Michael Aizenman,et al.  Percolation Critical Exponents Under the Triangle Condition , 1991 .

[20]  Remco van der Hofstad,et al.  The lace expansion on a tree with application to networks of self-avoiding walks , 2003, Adv. Appl. Math..

[21]  Remco van der Hofstad,et al.  Expansion in $n^{-1}$ for percolation critical values on the $n$-cube and $Z^n$: the first three terms , 2004 .

[22]  Joel H. Spencer,et al.  Random subgraphs of finite graphs: I. The scaling window under the triangle condition , 2005, Random Struct. Algorithms.

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

[24]  Charles M. Newman,et al.  Tree graph inequalities and critical behavior in percolation models , 1984 .

[25]  G. Slade,et al.  Mean-field critical behaviour for percolation in high dimensions , 1990 .

[26]  Gordon Slade,et al.  Mean-Field Behaviour and the Lace Expansion , 1994 .