A note about critical percolation on finite graphs
From MaRDI portal
(Redirected from Publication:662883)
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.
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
Cites work
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- Critical random graphs: Diameter and mixing time
- Mean-field critical behaviour for percolation in high dimensions
- Percolation critical exponents under the triangle condition
- 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: I. The scaling window under the triangle condition
- The Alexander-Orbach conjecture holds in high dimensions
- The Evolution of Random Graphs
- Tree graph inequalities and critical behavior in percolation models
Cited in
(15)- Hypercube percolation
- Critical percolation on random regular graphs
- 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
- Universal finite-size scaling for percolation theory in high dimensions
- Absence of percolation in graphs based on stationary point processes with degrees bounded by two
- 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)
