Random graph asymptotics on high-dimensional tori
From MaRDI portal
Publication:883043
DOI10.1007/S00220-006-0152-8zbMath1128.82010arXivmath/0512522OpenAlexW2089498317MaRDI QIDQ883043
Markus Heydenreich, Remco van der Hofstad
Publication date: 31 May 2007
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0512522
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Related Items (19)
Random subgraphs of the 2D Hamming graph: The supercritical phase ⋮ The scaling window of the 5D Ising model with free boundary conditions ⋮ Critical site percolation in high dimension ⋮ 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 ⋮ Finite size scaling of the 5D Ising model with free boundary conditions ⋮ High-dimensional near-critical percolation and the torus plateau ⋮ Non-vanishing boundary effects and quasi-first-order phase transitions in high dimensional Ising models ⋮ Scaling limits for the threshold window: when does a monotone Boolean function flip its outcome? ⋮ Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time ⋮ A note about critical percolation on finite graphs ⋮ The Evolution of the Cover Time ⋮ Hypercube percolation ⋮ Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ Critical behavior in inhomogeneous random graphs ⋮ Correction to: ``Random graph asymptotics on high-dimensional tori. II: Volume, diameter and mixing time ⋮ Universal finite-size scaling for percolation theory in high dimensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean-field critical behaviour for percolation in high dimensions
- The incipient infinite cluster in two-dimensional percolation
- Tree graph inequalities and critical behavior in percolation models
- Subdiffusive behavior of random walk on a random cluster
- Percolation critical exponents under the triangle condition
- Choosing a spanning tree for the integer lattice uniformly
- Brownian excursions, critical random graphs and the multiplicative coalescent
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Invasion percolation and the incipient infinite cluster in 2D
- The lowest crossing in two-dimensional critical percolation
- The scaling limit of the incipient infinite cluster in high-dimensional percolation. I: Critical exponents
- The incipient infinite cluster for high-dimensional unoriented percolation
- Sharpness of the phase transition in percolation models
- Mean-field critical behaviour for correlation length for percolation in high dimensions
- Construction of the Incipient Infinite cluster for spread-out oriented percolation above \(4 + 1\) dimensions
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus
- 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
- Loop-erased random walk on a torus in dimensions 4 and above
- Inequalities with applications to percolation and reliability
- Percolation
- The Structure of a Random Graph at the Point of the Phase Transition
- Random subgraphs of finite graphs: I. The scaling window under the triangle condition
- The birth of the infinite cluster: Finite-size scaling in percolation
This page was built for publication: Random graph asymptotics on high-dimensional tori