The diameter of a long-range percolation graph
The authors consider a random graph \(G=G(N)\) on the node set \([N]_d\equiv\{0,1,\dots,N\}^d\) equipped with the \(l^1\) norm~\(\|\cdot\|\). Nodes \({\mathbf x}\), \({\mathbf y}\in[N]_d\) are connected with probability \(1\) if \(\|{\mathbf x}-{\mathbf y}\|=1\), and, otherwise, with probability \(1-\exp\{-\beta/\|{\mathbf x}-{\mathbf y}\|^s\}\), where \(\beta>0\), \(s>0\) are some fixed parameters. It is believed that the (random) diameter \(D(N)\) of the graph \(G\) exhibits a phase transition at \(s=d\) and \(s=2d\). A one-dimensional version of this model with periodic boundary conditions (i.e., on a circle) was studied by \textit{I. Benjamini} and \textit{N. Berger} [Random Struct.\ Algorithms 19, No.~2, 102-111 (2001; Zbl 0983.60099)], but cases \(s=1\) and \(s=2\) were left open. In the current paper the authors obtain various bounds on \(D(N)\) supporting the double phase transition conjecture in dimensions \(d\geq 1\) and, in particular, finish the description of the one-dimensional case at \(s=1\) and \(s=2\).
- The diameter of a long-range percolation cluster on generalized pre-Sierpinski carpet and regular tree
- A modified bootstrap percolation on a random graph coupled with a lattice
- On the scaling of the chemical distance in long-range percolation models
- Two-dimensional SIR epidemics with long range infection
- Graph distances of continuum long-range percolation
- The diameter of a long-range percolation cluster on pre-Sierpinski gasket
- Could any graph be turned into a small-world?
- Eclecticism shrinks even small worlds
- Close to optimal decentralized routing in long-range contact networks
- Graph diameter in long-range percolation
- Scale-free percolation
- A strong law of large numbers for random biased connected graphs
- The diameter of a long-range percolation graph
- Effect of scale on long-range random graphs and chromosomal inversions
- scientific article; zbMATH DE number 2119680 (Why is no real title available?)
- scientific article; zbMATH DE number 861400 (Why is no real title available?)
- Template-Based Minor Embedding for Adiabatic Quantum Optimization
- On the connectivity and diameter of small-world networks
- Ultra-small scale-free geometric networks
- Efficient routeing in Poisson small-world networks
- Expansion and Lack Thereof in Randomly Perturbed Graphs
- On the distances within cliques in a soft random geometric graph
- Arithmetic oscillations of the chemical distance in long-range percolation on \(\mathbb{Z}^d\)
- Cluster-size decay in supercritical long-range percolation
- The longest edge in discrete and continuous long-range percolation
- Four universal growth regimes in degree-dependent first passage percolation on spatial random graphs
- Critical values in a long-range percolation on spaces like fractals
- Inhomogeneous long-range percolation on the hierarchical lattice
- The growth of the infinite long-range percolation cluster
This page was built for publication: The diameter of a long-range percolation graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150196)