Cycle structure of percolation on high-dimensional tori
From MaRDI portal
(Redirected from Publication:405505)
Abstract: In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one for percolation on the complete graph or Erdos-Renyi random graph, raising the question whether the scaling limits of the largest connected components, as identified by Aldous (1997), are also equal. In this paper, we investigate the cycle structure of the largest critical components for high-dimensional percolation on the torus (Z/rZ)^d. While percolation clusters naturally have many short cycles, we show that the long cycles, i.e., cycles that pass through the boundary of the cube of width r/4 centered around each of their vertices, have length of order r^{d/3}, as on the critical Erdos-Renyi random graph. On the Erdos-Renyi random graph, cycles play an essential role in the scaling limit of the large critical clusters, as identified by Addario-Berry, Broutin and Goldschmidt (arXiv:0908.3629). Our proofs crucially rely on various new estimates of probabilities of the existence of open paths in critical Bernoulli percolation on Z^d with constraints on their lengths. We believe these estimates are interesting in their own right.
Recommendations
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- Arm exponents in high dimensional percolation
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Critical random graphs: Diameter and mixing time
- Critical random graphs: limiting constructions and distributional properties
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
- Hypercube percolation
- Mean-field critical behaviour for percolation in high dimensions
- On the upper critical dimension of Bernoulli percolation
- Percolation
- Random graph asymptotics on high-dimensional tori
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Random subgraphs of finite graphs. III: The phase transition for the \(n\)-cube
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- The Alexander-Orbach conjecture holds in high dimensions
- The Structure of a Random Graph at the Point of the Phase Transition
- The birth of the giant component
- The critical probability of bond percolation on the square lattice equals 1/2
Cited in
(11)- Geometry of the minimal spanning tree of a random 3-regular graph
- High-dimensional near-critical percolation and the torus plateau
- The near-critical two-point function and the torus plateau for weakly self-avoiding walk in high dimensions
- On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
- The survival probability and \(r\)-point functions in high dimensions
- Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?
- Random graph asymptotics on high-dimensional tori
- Universal finite-size scaling for percolation theory in high dimensions
- Random walk on the high-dimensional IIC
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Subcritical connectivity and some exact tail exponents in high dimensional percolation
This page was built for publication: Cycle structure of percolation on high-dimensional tori
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405505)
