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

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 0903.4279 / rank
 
Normal rank

Revision as of 16:28, 18 April 2024

scientific article
Language Label Description Also known as
English
Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
scientific article

    Statements

    Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time (English)
    0 references
    0 references
    0 references
    11 October 2011
    0 references
    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.
    0 references
    0 references
    percolation
    0 references
    random graph asymptotics
    0 references
    mean-field behavior
    0 references
    critical window
    0 references
    0 references
    0 references