Graph distances in scale-free percolation: the logarithmic case
From MaRDI portal
Publication:5881002
DOI10.1017/jpr.2022.44OpenAlexW4304172816MaRDI QIDQ5881002
Unnamed Author, Markus Heydenreich
Publication date: 9 March 2023
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.05709
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items
Scale-free percolation mixing time ⋮ Distances in \(\frac{1}{\|x-y\|^{2d}}\) percolation models for all dimensions
Cites Work
- Scale-free percolation
- The growth of the infinite long-range percolation cluster
- One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\)
- Structures in supercritical scale-free percolation
- Geometric inhomogeneous random graphs
- On the scaling of the chemical distance in long-range percolation models
- Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
- Greedy routing and the algorithmic small-world phenomenon
- Recurrence versus transience for weight-dependent random connection models
- Distances and large deviations in the spatial preferential attachment model
- Scale-free percolation in continuum space
- Random Graphs and Complex Networks
- The small-world phenomenon
- Scale-free percolation in continuous space: quenched degree and clustering coefficient
- Sharp asymptotic for the chemical distance in long‐range percolation
- Percolation phase transition in weight-dependent random connection models
- Greedy Routing and the Algorithmic Small-World Phenomenon
This page was built for publication: Graph distances in scale-free percolation: the logarithmic case
