Sharp asymptotic for the chemical distance in long‐range percolation
From MaRDI portal
Publication:4973637
DOI10.1002/rsa.20849zbMath1428.05164arXiv1705.10380OpenAlexW3103275759WikidataQ128093246 ScholiaQ128093246MaRDI QIDQ4973637
No author found.
Publication date: 28 November 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.10380
Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Connectivity (05C40)
Related Items (8)
Graph distances in scale-free percolation: the logarithmic case ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ Distances in \(\frac{1}{\|x-y\|^{2d}}\) percolation models for all dimensions ⋮ The diameter of a long-range percolation cluster on generalized pre-Sierpinski carpet and regular tree ⋮ Graph distances of continuum long-range percolation ⋮ Quenched invariance principle for a class of random conductance models with long-range jumps ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Power-law bounds for critical long-range percolation below the upper-critical dimension
This page was built for publication: Sharp asymptotic for the chemical distance in long‐range percolation
