Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time (Q639871): Difference between revisions

The authors study critical bond-percolation on high-dimensional tori, removing a logarithmic correction in the lower bound considered in their previous paper [\textit{M. Heydenreich} and \textit{R. van der Hofstad}, Commun. Math. Phys. 270, No.~2, 335--358 (2007; Zbl 1128.82010)] and prove sharp lower bounds on the size of the largest cluster. The main result of the paper is that the behavior of the critical percolation on high-dimensional tori is the same as for critical Erdös-Rényi random graphs.