Highly connected random geometric graphs

DOI10.1016/j.dam.2008.03.001zbMath1156.05054OpenAlexW1966574936MaRDI QIDQ1003675

Mark Walters, Amites Sarkar, Béla Bollobás, Paul N. Balister

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.001

zbMATH Keywords

connectivityPoisson processrandom geometric graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Special processes (60K99) Connectivity (05C40)

Related Items

Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model, Geometric random graphs and Rado sets in sequence spaces, Vulnerability of nearest neighbor graphs, Infinite random geometric graphs, Randomized near-neighbor graphs, giant components and applications in data science, Hamilton cycles in random geometric graphs

Cites Work

• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• Connectivity of random k-nearest-neighbour graphs
• Unnamed Item