Random Graph Asymptotics on High-Dimensional Tori

We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in sufficiently high dimensions, or when d > 6 for sufficiently spread-out percolation. We use a relatively simple coupling argument to show that this largest critical cluster is, with high probability, bounded above by a large constant times V2/3 and below by a small constant times $${V^{2/3}(\log{V})^{-4/3}}$$ , where V is the volume of the torus. We also give a simple criterion in terms of the subcritical percolation two-point function on $${\mathbb{Z}^d}$$ under which the lower bound can be improved to small constant times $${V^{2/3}}$$ , i.e. we prove random graph asymptotics for the largest critical cluster on the high-dimensional torus. This establishes a conjecture by [1], apart from logarithmic corrections. We discuss implications of these results on the dependence on boundary conditions for high-dimensional percolation.Our method is crucially based on the results in [11, 12], where the $${V^{2/3}}$$ scaling was proved subject to the assumption that a suitably defined critical window contains the percolation threshold on $${\mathbb{Z}^d}$$ . We also strongly rely on mean-field results for percolation on $${\mathbb{Z}^d}$$ proved in [17–20].

[1]  Harry Kesten,et al.  The incipient infinite cluster in two-dimensional percolation , 1986 .

[2]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

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

[5]  B. Pittel,et al.  The structure of a random graph at the point of the phase transition , 1994 .

[6]  Jason Schweinsberg.  The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus , 2006, math/0602515.

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

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

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

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

[11]  G. Lawler.  Intersections of random walks , 1991 .

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

[13]  Antal A. Járai.  Invasion Percolation and the Incipient Infinite Cluster in 2D , 2003 .

[14]  G. Slade,et al.  Construction of the Incipient Infinite Cluster for Spread-out Oriented Percolation Above 4 + 1 Dimensions , 2002 .

[15]  David Aldous,et al.  Brownian excursions, critical random graphs and the multiplicative coalescent , 1997 .

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

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

[18]  Gordon Slade,et al.  The Scaling Limit of the Incipient Infinite Cluster in High-Dimensional Percolation. I. Critical Exponents , 1999, math-ph/9903042.

[19]  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.

[20]  N. S. Barnett,et al.  Private communication , 1969 .

[21]  Svante Janson.  Multicyclic Components in a Random Graph Process , 1993, Random Struct. Algorithms.

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

[23]  A. Járai.  Incipient infinite percolation clusters in 2D , 2003 .

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

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

[27]  Mean-field critical behaviour for correlation length for percolation in high dimensions , 1990 .

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

[29]  Jean Picard,et al.  The Lace Expansion and its Applications , 2006 .

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

[31]  The lowest crossing in two-dimensional critical percolation , 2002, math/0201030.

[32]  R. van der Hofstad,et al.  The Incipient Infinite Cluster for High-Dimensional Unoriented Percolation , 2004 .

[33]  Takashi Hara,et al.  Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals. , 2005, math-ph/0504021.

[34]  I. Benjamini,et al.  Percolation Beyond $Z^d$, Many Questions And a Few Answers , 1996 .

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

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

[37]  R. Pemantle.  Choosing a Spanning Tree for the Integer Lattice Uniformly , 1991, math/0404043.

[38]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

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

[40]  H. Kesten.  Subdiffusive behavior of random walk on a random cluster , 1986 .

[41]  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.

[42]  Joel H. Spencer,et al.  Uniform boundedness of critical crossing probabilities implies hyperscaling , 1999, Random Struct. Algorithms.