First passage percolation on random geometric graphs and an application to shortest-path trees

Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Planar graphs; geometric and topological aspects of graph theory (05C10) Percolation (82B43)

Cites Work

An Introduction to the Theory of Point Processes
Random Geometric Graphs
Theory of Random Sets
Stochastic and Integral Geometry
Title not available (Why is that?)
An Introduction to the Theory of Point Processes
Domination by product measures
Large Deviations for the Graph Distance in Supercritical Continuum Percolation
Surface order large deviations for high-density percolation
Title not available (Why is that?)
Continuum percolation in the Gabriel graph
Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
Subadditive ergodic theory
Short-length routes in low-cost networks via Poisson line patterns
Connected spatial networks over random points and a route-length statistic
Title not available (Why is that?)
Surface order large deviations for Ising, Potts and percolation models
On the chemical distance for supercritical Bernoulli percolation
On the distribution of typical shortest-path lengths in connected random geometric graphs
The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane
Large deviations for the chemical distance in supercritical Bernoulli percolation
Descending chains, the lilypond model, and mutual-nearest-neighbour matching
Title not available (Why is that?)
On complex zeros of the \(q\)-Potts partition function for a self-dual family of graphs
Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
Random Johnson-Mehl tessellations
Title not available (Why is that?)
Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests
A Parametric Copula Approach for Modelling Shortest-Path Trees in Telecommunication Networks
Moderate deviations for shortest-path lengths on random segment processes
Asymptotics for First-Passage Times on Delaunay Triangulations
Capacity distributions in spatial stochastic models for telecommunication networks

Cited In (11)

Limiting shape for first-passage percolation models on random geometric graphs
Moderate deviations for shortest-path lengths on random segment processes
Route lengths in invariant spatial tree networks
First passage percolation on locally treelike networks. I. Dense random graphs
Ratio convergence rates for Euclidean first-passage percolation: applications to the graph infinity Laplacian
Constrained minimum passage time in random geometric graphs
Asymptotic properties of Euclidean shortest-path trees in random geometric graphs
On the treewidth of random geometric graphs and percolated grids
THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
Short paths for first passage percolation on the complete graph
First-passage percolation on the random graph

   Recommendations

Asymptotic properties of Euclidean shortest-path trees in random geometric graphs 👍 👎
First-passage percolation on the random graph 👍 👎
Constrained minimum passage time in random geometric graphs 👍 👎
Universality for first passage percolation on sparse random graphs 👍 👎
On the distribution of typical shortest-path lengths in connected random geometric graphs 👍 👎

This page was built for publication: First passage percolation on random geometric graphs and an application to shortest-path trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262444)