Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests
From MaRDI portal
Publication:4915648
DOI10.1239/aap/1363354101zbMath1268.60066OpenAlexW2046761586MaRDI QIDQ4915648
Christian Hirsch, Volker Schmidt, David Neuhäuser
Publication date: 11 April 2013
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aap/1363354101
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Percolation (82B43) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)
Related Items (3)
Stationary Apollonian packings ⋮ Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\) ⋮ First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees
Cites Work
- Unnamed Item
- On the distribution of typical shortest-path lengths in connected random geometric graphs
- Minimal spanning forests
- Connected spatial networks over random points and a route-length statistic
- The relative neighbourhood graph of a finite planar set
- A self-avoiding random walk
- Asymptotics for Euclidean minimal spanning trees on random points
- Domination by product measures
- Trees and matchings from point processes
- Weak laws of large numbers in geometric probability
- Central limit theorems for some graphs in computational geometry.
- Percolation and minimal spanning forests in infinite graphs
- Processes on unimodular random networks
- Ends in free minimal spanning forests
- Percolation
- Stationary partitions and Palm probabilities
- On Comparison of Clustering Properties of Point Processes
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
This page was built for publication: Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests
