Connectivity of Random Geometric Graphs Related to Minimal Spanning Forests

DOI10.1239/aap/1363354101zbMath1268.60066MaRDI 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

zbMATH Keywords

point process; continuum percolation; minimal spanning forest; beta-skeleton; descending chain

Mathematics Subject Classification ID

60D05: Geometric probability and stochastic geometry

05C80: Random graphs (graph-theoretic aspects)

05C10: Planar graphs; geometric and topological aspects of graph theory

82B43: Percolation

60G55: Point processes (e.g., Poisson, Cox, Hawkes processes)

Related Items

First Passage Percolation on Random Geometric Graphs and an Application to Shortest-Path Trees, Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\), Stationary Apollonian packings

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