Connectivity of random k-nearest-neighbour graphs

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

Recommendations

On the Connectivity of Random k-th Nearest Neighbour Graphs
scientific article; zbMATH DE number 1222330
$k$-connectivity in random graphs
k-connectivity in random undirected graphs
Connectedness of certain random graphs
On the connectedness of a random graph
scientific article; zbMATH DE number 3904623
On the connectivity of a random interval graph
On the strength of connectedness of a random graph
Connectivity of inhomogeneous random graphs

Cites work

A clustering procedure based on the comparison between the $k$ nearest neighbors graph and the minimal spanning tree.
Continuum Percolation
Continuum percolation with steps in an annulus
Edge-isoperimetric inequalities in the grid
Efficient measurement of the percolation threshold for fully penetrable discs
Random Geometric Graphs
Random graphs.
Random Plane Networks
The longest edge of the random minimal spanning tree

Cited in

(45)

Highly connected random geometric graphs
k-connectivity in random undirected graphs
$k$-connectivity in random graphs
Connectivity threshold for random chordal graphs
Zero-one law for connectivity in superposition of random key graphs on random geometric graphs
The connectivity of a graph on uniform points on [0,\,1]$^{d}$.
Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem
Modeling limited attention in opinion dynamics by topological interactions
On the number of weakly connected subdigraphs in random $k$NN digraphs
The connectivity threshold of random geometric graphs with Cantor distributed vertices
Consensus of flocks under $M$-nearest-neighbor rules
The size of components in continuum nearest-neighbor graphs
Degree distributions in $AB$ random geometric graphs
The specific connectivity number of random networks
Connectivity threshold of Bluetooth graphs
Connectivity of soft random geometric graphs
A research on connectivity in communication networks
On covering by translates of a set
Sharpness in the k-nearest-neighbours random geometric graph model
Randomized near-neighbor graphs, giant components and applications in data science
Almost optimal sparsification of random geometric graphs
A critical constant for the k nearest-neighbour model
One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
Distribution of components in the $k$-nearest neighbour random geometric graph for $k$ below the connectivity threshold
Limit behaviors of random connected graphs driven by a Poisson process
scientific article; zbMATH DE number 1222330 (Why is no real title available?)
scientific article; zbMATH DE number 1340281 (Why is no real title available?)
Small components in $k$-nearest neighbour graphs
Random Geometric Graphs
Connectedness of graphs generated by a random d-process
The random connection model: Connectivity, edge lengths, and degree distributions
On the Connectivity of Random k-th Nearest Neighbour Graphs
Connectivity of random geometric graphs related to minimal spanning forests
A new random graph model with self-optimizing nodes: connectivity and diameter
A random-line-graph approach to overlapping line segments
On the connectivity and diameter of small-world networks
Hamilton cycles in random geometric graphs
ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
Bootstrap percolation in random geometric graphs
Largest nearest-neighbour link and connectivity threshold in a polytopal random sample
Asymptotic analysis of k-hop connectivity in the 1D unit disk random graph model
Planar reinforced k-out percolation
Dominating set, independent set, discrete k-center, dispersion, and related problems for planar points in convex position
Computing maximum cliques in unit disk graphs
The distant-2 chromatic number of random proximity and random geometric graphs

This page was built for publication: Connectivity of random k-nearest-neighbour graphs

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