First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees
From MaRDI portal
Publication:5262444
DOI10.1239/aap/1435236978zbMath1355.60018OpenAlexW1490071018MaRDI QIDQ5262444
Christian Hirsch, C. Gloaguen, Volker Schmidt, David Neuhäuser
Publication date: 15 July 2015
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aap/1435236978
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Percolation (82B43)
Related Items (5)
THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS ⋮ Moderate deviations for shortest-path lengths on random segment processes ⋮ Limiting shape for first-passage percolation models on random geometric graphs ⋮ Asymptotic properties of Euclidean shortest-path trees in random geometric graphs ⋮ Route lengths in invariant spatial tree networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the distribution of typical shortest-path lengths in connected random geometric graphs
- On complex zeros of the \(q\)-Potts partition function for a self-dual family of graphs
- Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
- Connected spatial networks over random points and a route-length statistic
- Subadditive ergodic theory
- Domination by product measures
- Surface order large deviations for Ising, Potts and percolation models
- Surface order large deviations for high-density percolation
- Large deviations for the chemical distance in supercritical Bernoulli percolation
- On the chemical distance for supercritical Bernoulli percolation
- A Parametric Copula Approach for Modelling Shortest-Path Trees in Telecommunication Networks
- CAPACITY DISTRIBUTIONS IN SPATIAL STOCHASTIC MODELS FOR TELECOMMUNICATION NETWORKS
- Moderate deviations for shortest-path lengths on random segment processes
- Asymptotics for First-Passage Times on Delaunay Triangulations
- Stochastic and Integral Geometry
- Random Johnson-Mehl tessellations
- Random Geometric Graphs
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
- Continuum percolation in the Gabriel graph
- The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane
- An Introduction to the Theory of Point Processes
- Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests
- Short-length routes in low-cost networks via Poisson line patterns
- Large Deviations for the Graph Distance in Supercritical Continuum Percolation
- Theory of Random Sets
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- An Introduction to the Theory of Point Processes
This page was built for publication: First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees
