Highly connected random geometric graphs

DOI10.1016/J.DAM.2008.03.001zbMATH Open1156.05054OpenAlexW1966574936MaRDI QIDQ1003675FDOQ1003675

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

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

Poisson processconnectivityrandom geometric graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Connectivity of random k-nearest-neighbour graphs
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.

Cited In (6)

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

This page was built for publication: Highly connected random geometric graphs

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