First passage percolation on random geometric graphs and an application to shortest-path trees
From MaRDI portal
Publication:5262444
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
Cites work
- scientific article; zbMATH DE number 3971949 (Why is no real title available?)
- scientific article; zbMATH DE number 17688 (Why is no real title available?)
- scientific article; zbMATH DE number 3595945 (Why is no real title available?)
- scientific article; zbMATH DE number 747046 (Why is no real title available?)
- scientific article; zbMATH DE number 3231627 (Why is no real title available?)
- A parametric copula approach for modelling shortest-path trees in telecommunication networks
- An Introduction to the Theory of Point Processes
- An Introduction to the Theory of Point Processes
- Asymptotics for first-passage times on Delaunay triangulations
- Capacity distributions in spatial stochastic models for telecommunication networks
- Connected spatial networks over random points and a route-length statistic
- Connectivity of random geometric graphs related to minimal spanning forests
- Continuum percolation in the Gabriel graph
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- Domination by product measures
- Large deviations for the chemical distance in supercritical Bernoulli percolation
- Large deviations for the graph distance in supercritical continuum percolation
- Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks
- Moderate deviations for shortest-path lengths on random segment processes
- On complex zeros of the \(q\)-Potts partition function for a self-dual family of graphs
- On the chemical distance for supercritical Bernoulli percolation
- On the distribution of typical shortest-path lengths in connected random geometric graphs
- Random Geometric Graphs
- Random Johnson-Mehl tessellations
- Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\)
- Short-length routes in low-cost networks via Poisson line patterns
- Stochastic and Integral Geometry
- Subadditive ergodic theory
- Surface order large deviations for Ising, Potts and percolation models
- Surface order large deviations for high-density percolation
- The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane
- Theory of Random Sets
Cited in
(14)- 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
- Long-range first-passage percolation on the torus
- 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
- On the distribution of typical shortest-path lengths in connected random geometric graphs
- First and second moments of the size distribution of bond percolation clusters on rings, paths and stars
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)
