Abstract
We show that the mean-field model for percolation on the high-dimensional torus is the Erdős-Rényi random graph, in the sense that the phase transition for percolation on the high-dimensional torus mimics that of percolation on the complete graph. We first draw inspiration from the Erdős-Rényi random graph. We rigorously prove a number of statements for the Erdős-Rényi random graph, whose proofs can be modified to the setting of high-dimensional tori. We proceed to critical percolation on high-dimensional tori, and extend this discussion to more general tori including the hypercube. We continue by focussing exclusively on the hypercube, where also the supercritical regime is now well understood. Then we discuss scaling limits of critical percolation on random graphs and close this chapter by discussing the role of boundary conditions beyond the periodic boundary conditions that give rise to high-dimensional tori.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Interestingly, Aizenman and Newman achieved this without the BK inequality, which was only proved later.
- 2.
We learned of the possible choices \(p_{\mathrm {c}}^{(2)}\) and \(p_{\mathrm {c}}^{(3)}\) through private communication with Asaf Nachmias.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Heydenreich, M., van der Hofstad, R. (2017). Finite-Size Scaling and Random Graphs. In: Progress in High-Dimensional Percolation and Random Graphs. CRM Short Courses. Springer, Cham. https://doi.org/10.1007/978-3-319-62473-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-62473-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-62472-3
Online ISBN: 978-3-319-62473-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)