Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model
type: Item
instance of: scholarly article
title: Sharpness in the k-Nearest-Neighbours Random Geometric Graph Model
zbMATH Open document ID: 1278.60142
author: Victor Falgas-Ravry
author: Mark Walters
published in: Advances in Applied Probability
publication date: 2012-11-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1101.3083
full work available at URL: https://projecteuclid.org/euclid.aap/1346955257
Mathematics Subject Classification ID: 60K35
Mathematics Subject Classification ID: 82B43
zbMATH DE Number: 6101457
zbMATH Keywords: random geometric graph
zbMATH Keywords: connectivity
zbMATH Keywords: sharp transition
MaRDI profile type: Publication
OpenAlex ID: W2012399955
arXiv ID: 1101.3083
cites work: Connectivity of random k-nearest-neighbour graphs
cites work: A critical constant for the k nearest-neighbour model
cites work: Highly connected random geometric graphs
cites work: Random Plane Networks
cites work: A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
cites work: The longest edge of the random minimal spanning tree
cites work: Q4265786
cites work: Random Geometric Graphs
cites work: Small components in \(k\)-nearest neighbour graphs
DOI: 10.1239/AAP/1346955257
description: scientific article