The diameter of a long-range percolation graph

DOI10.1002/rsa.10042zbMath1011.60086OpenAlexW2088668624MaRDI QIDQ3150196

M. I. Sviridenko, Don Coppersmith, David Gamarnik

Publication date: 25 May 2003

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10042

zbMATH Keywords

phase transitionrandom graphlong-range percolation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)

Related Items (20)

Could any graph be turned into a small-world? ⋮ Eclecticism shrinks even small worlds ⋮ Critical values in a long-range percolation on spaces like fractals ⋮ Template-Based Minor Embedding for Adiabatic Quantum Optimization ⋮ Scale-free percolation ⋮ A strong law of large numbers for random biased connected graphs ⋮ Inhomogeneous long-range percolation on the hierarchical lattice ⋮ On the distances within cliques in a soft random geometric graph ⋮ A modified bootstrap percolation on a random graph coupled with a lattice ⋮ Graph distances of continuum long-range percolation ⋮ On the scaling of the chemical distance in long-range percolation models ⋮ Two-dimensional SIR epidemics with long range infection ⋮ Ultra-small scale-free geometric networks ⋮ Efficient routeing in Poisson small-world networks ⋮ The growth of the infinite long-range percolation cluster ⋮ On the connectivity and diameter of small-world networks ⋮ Expansion and Lack Thereof in Randomly Perturbed Graphs ⋮ Graph diameter in long-range percolation ⋮ Close to optimal decentralized routing in long-range contact networks ⋮ The diameter of a long-range percolation cluster on pre-Sierpinski gasket

This page was built for publication: The diameter of a long-range percolation graph