The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]d

DOI10.2307/1428076zbMath0899.05060OpenAlexW4243372951MaRDI QIDQ4361795

Ralph P. Russo, Martin J. B. Appel

Publication date: 28 October 1997

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

Full work available at URL: https://doi.org/10.2307/1428076

zbMATH Keywords

random graphrandom distributionmaximum vertex degree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (8)

Central limit theorems for \(k\)-nearest neighbour distances ⋮ Topological properties of random wireless networks ⋮ Unnamed Item ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ Vertex degree of random geometric graph on exponentially distributed points ⋮ On covering by translates of a set ⋮ On the typical case complexity of graph optimization ⋮ The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]

This page was built for publication: The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1]^d