Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model
From MaRDI portal
Publication:3167331
DOI10.1239/aap/1346955257zbMath1278.60142arXiv1101.3083OpenAlexW2012399955MaRDI QIDQ3167331
Mark Walters, Victor Falgas-Ravry
Publication date: 2 November 2012
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.3083
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Related Items (4)
Bootstrap percolation in random geometric graphs ⋮ Small components in \(k\)-nearest neighbour graphs ⋮ Randomized near-neighbor graphs, giant components and applications in data science ⋮ Speed and concentration of the covering time for structured coupon collectors
Cites Work
- Unnamed Item
- Small components in \(k\)-nearest neighbour graphs
- Highly connected random geometric graphs
- The longest edge of the random minimal spanning tree
- A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
- A critical constant for the k nearest-neighbour model
- Random Plane Networks
- Random Geometric Graphs
- Connectivity of random k-nearest-neighbour graphs
This page was built for publication: Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model