Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time

DOI10.1007/s00440-009-0258-yzbMath1229.60108arXiv0903.4279OpenAlexW2167405849MaRDI QIDQ639871

Markus Heydenreich, Remco van der Hofstad

Publication date: 11 October 2011

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

percolationcritical windowmean-field behaviorrandom graph asymptotics

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Related Items

Exact enumeration of self-avoiding walks on critical percolation clusters in 2–7 dimensions, Subcritical connectivity and some exact tail exponents in high dimensional percolation, On breadth‐first constructions of scaling limits of random graphs and random unicellular maps, Cycle structure of percolation on high-dimensional tori, Random networks with sublinear preferential attachment: the giant component, High-dimensional near-critical percolation and the torus plateau, Weakly self-avoiding walk on a high-dimensional torus, Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome?, Mixing time of near-critical random graphs, Unlacing hypercube percolation: a survey, A note about critical percolation on finite graphs, Hypercube percolation, Random walk on the high-dimensional IIC, Novel scaling limits for critical inhomogeneous random graphs, Geometry of the minimal spanning tree of a random 3-regular graph, Correction to: ``Random graph asymptotics on high-dimensional tori. II: Volume, diameter and mixing time, Expansion in supercritical random subgraphs of the hypercube and its consequences, Universal finite-size scaling for percolation theory in high dimensions

Cites Work

• Unnamed Item
• 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
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The scaling limit of the incipient infinite cluster in high-dimensional percolation. I: Critical exponents
• Sharpness of the phase transition in percolation models
• Mean-field critical behaviour for correlation length for percolation in high dimensions
• Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
• Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
• The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
• On the number of incipient spanning clusters
• Random subgraphs of finite graphs. II: The lace expansion and the triangle condition
• The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion
• Critical percolation on random regular graphs
• Percolation
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition