Year: 2010
Type: article
Abstract: We study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in \documentclass{article} \usepackage{amsmath,amsfonts}\pagestyle{empty}\begin{document} ${\mathbb Z}^d$ \end{document} . We focus on the cases when an edge between x and y is added with probability decaying with the Euclidean distance as |x − y|−s+o(1) when |x − y| → ∞. For s ∈ (d, 2d) we show that the graph diameter for the graph reduced to a box of side L scales like (log L)Δ+o(1) where Δ−1 := log2(2d/s). In particular, the diameter grows about as fast as the typical graph distance between two vertices at distance L. We also show that a ball of radius r in the intrinsic metric on the (infinite) graph will roughly coincide with a ball of radius exp{r1/Δ+o(1)} in the Euclidean metric. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 210‐227, 2011
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.20349
Author: Marek Biskup
Language: English
Subfield: Mathematical Physics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2012604491