A critical constant for the k nearest-neighbour model

DOI10.1239/aap/1240319574zbMath1160.05333arXiv0708.4007OpenAlexW2012430523MaRDI QIDQ3625644

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

Publication date: 6 May 2009

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.4007

zbMATH Keywords

connectivityPoisson processrandom geometric graphk-nearest neighbours

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Percolation (82B43) Connectivity (05C40) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items

Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model, Bootstrap percolation in random geometric graphs, Small components in \(k\)-nearest neighbour graphs, Randomized near-neighbor graphs, giant components and applications in data science, Hamilton cycles in random geometric graphs, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter

Cites Work

• Connectivity of random k-nearest-neighbour graphs