A note about critical percolation on finite graphs
From MaRDI portal
Publication:662883
DOI10.1007/S10959-010-0283-XzbMATH Open1235.60138arXiv0909.4351OpenAlexW2164643459MaRDI QIDQ662883FDOQ662883
Authors: Gady Kozma, Asaf Nachmias 
Publication date: 13 February 2012
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Abstract: In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and here we show that its diameter is n^{1/3} and that the simple random walk takes n steps to mix on it. Our results apply to critical percolation on several high-dimensional finite graphs such as the finite torus Z_n^d (with d large and n tending to infinity) and the Hamming cube {0,1}^n.
Full work available at URL: https://arxiv.org/abs/0909.4351
Recommendations
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Slightly subcritical hypercube percolation
- Critical percolation on random regular graphs
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
- Random graph asymptotics on high-dimensional tori
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cites Work
- Title not available (Why is that?)
- Tree graph inequalities and critical behavior in percolation models
- 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
- Random graph asymptotics on high-dimensional tori
- The Evolution of Random Graphs
- The Alexander-Orbach conjecture holds in high dimensions
- Percolation critical exponents under the triangle condition
- Mean-field critical behaviour for percolation in high dimensions
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- Critical random graphs: Diameter and mixing time
Cited In (15)
- Critical percolation on random regular graphs
- Hypercube percolation
- Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
- On the expected total number of infections for virus spread on a finite network
- A proof of factorization formula for critical percolation
- On the critical probability in percolation
- Absence of percolation in graphs based on stationary point processes with degrees bounded by two
- Universal finite-size scaling for percolation theory in high dimensions
- A note on percolation in cocycle measures
- The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
- Critical percolation on scale-free random graphs: new universality class for the configuration model
- Cycle structure of percolation on high-dimensional tori
- Expansion of Percolation Critical Points for Hamming Graphs
- Homology-changing percolation transitions on finite graphs
- Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
This page was built for publication: A note about critical percolation on finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662883)
