A note about critical percolation on finite graphs

DOI10.1007/s10959-010-0283-xzbMath1235.60138arXiv0909.4351MaRDI QIDQ662883

Gady Kozma, Asaf Nachmias

Publication date: 13 February 2012

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.4351

zbMATH Keywords

critical exponents; triangle condition; critical percolation; intrinsic metric

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60K35: Interacting random processes; statistical mechanics type models; percolation theory

Related Items

Homology-changing percolation transitions on finite graphs, Universal finite-size scaling for percolation theory in high dimensions, Hypercube percolation, On the critical probability in percolation, On the expected total number of infections for virus spread on a finite network

Cites Work

• Unnamed Item
• Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
• Random graph asymptotics on high-dimensional tori
• Mean-field critical behaviour for percolation in high dimensions
• Critical random graphs: Diameter and mixing time
• The Alexander-Orbach conjecture holds in high dimensions
• Tree graph inequalities and critical behavior in percolation models
• Percolation critical exponents under the triangle condition
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• The Evolution of Random Graphs
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition