Random graph asymptotics on high-dimensional tori
From MaRDI portal
Publication:883043
DOI10.1007/S00220-006-0152-8zbMATH Open1128.82010arXivmath/0512522OpenAlexW2089498317MaRDI QIDQ883043FDOQ883043
Markus Heydenreich, Remco van der Hofstad
Publication date: 31 May 2007
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Abstract: We investigate the scaling of the largest critical percolation cluster on a large d-dimensional torus, for nearest-neighbor percolation in high dimensions, or when d>6 for sufficient 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 and below by a small constant times , where V is the volume of the torus. We also give a simple criterion in terms of the subcritical percolation two-point function on Z^d under which the lower bound can be improved to small constant times , i.e., we prove random graph asymptotics for the largest critical cluster on the high-dimensional torus. This establishes a conjecture by Aizenman (1997), 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 by Borgs, Chayes, van der Hofstad, Slade and Spencer (2005a, 2005b), where the scaling was proved subject to the assumption that a suitably defined critical window contains the percolation threshold on Z^d. We also strongly rely on mean-field results for percolation on Z^d proved by Hara (1990, 2005), Hara and Slade (1990) and Hara, van der Hofstad and Slade (2003).
Full work available at URL: https://arxiv.org/abs/math/0512522
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Percolation
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Sharpness of the phase transition in percolation models
- The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
- Tree graph inequalities and critical behavior in percolation models
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Choosing a spanning tree for the integer lattice uniformly
- On the number of incipient spanning clusters
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- The incipient infinite cluster in two-dimensional percolation
- Percolation critical exponents under the triangle condition
- The scaling limit of the incipient infinite cluster in high-dimensional percolation. I: Critical exponents
- Construction of the Incipient Infinite cluster for spread-out oriented percolation above \(4 + 1\) dimensions
- Mean-field critical behaviour for percolation in high dimensions
- Subdiffusive behavior of random walk on a random cluster
- Inequalities with applications to percolation and reliability
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- The Structure of a Random Graph at the Point of the Phase Transition
- Invasion percolation and the incipient infinite cluster in 2D
- The birth of the infinite cluster: Finite-size scaling in percolation
- Mean-field critical behaviour for correlation length for percolation in high dimensions
- The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
- The lowest crossing in two-dimensional critical percolation
- The incipient infinite cluster for high-dimensional unoriented percolation
- Loop-erased random walk on a torus in dimensions 4 and above
Cited In (19)
- Critical site percolation in high dimension
- Correction to: ``Random graph asymptotics on high-dimensional tori. II: Volume, diameter and mixing time
- Hypercube percolation
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- A note about critical percolation on finite graphs
- The Evolution of the Cover Time
- Random subgraphs of the 2D Hamming graph: The supercritical phase
- The scaling window of the 5D Ising model with free boundary conditions
- High-dimensional near-critical percolation and the torus plateau
- Non-vanishing boundary effects and quasi-first-order phase transitions in high dimensional Ising models
- Geometry of the minimal spanning tree of a random 3-regular graph
- Universal finite-size scaling for percolation theory in high dimensions
- Finite size scaling of the 5D Ising model with free boundary conditions
- On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
- Critical behavior in inhomogeneous random graphs
- Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?
- Cycle structure of percolation on high-dimensional tori
- Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk
- Subcritical connectivity and some exact tail exponents in high dimensional percolation
Recommendations
- Title not available (Why is that?) 👍 👎
- Cycle structure of percolation on high-dimensional tori 👍 👎
- Majority Bootstrap Percolation on the Hypercube 👍 👎
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time 👍 👎
- Percolation in High Dimensions 👍 👎
- Upper bounds on the percolation correlation length 👍 👎
- Power-law bounds for critical long-range percolation below the upper-critical dimension 👍 👎
- The dimension of the incipient infinite cluster 👍 👎
- Slightly subcritical hypercube percolation 👍 👎
- High-dimensional near-critical percolation and the torus plateau 👍 👎
This page was built for publication: Random graph asymptotics on high-dimensional tori
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883043)