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

DOI10.2307/1428077zbMath0899.05061OpenAlexW2058917139MaRDI QIDQ4361796

Ralph P. Russo, Martin J. B. Appel

Publication date: 8 November 1998

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

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

zbMATH Keywords

random graphrandom distributionminimum vertex degreelargest nearest-neighbor distance

Mathematics Subject Classification ID

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

Related Items (8)

Topological properties of random wireless networks ⋮ Unnamed Item ⋮ On the fundamental limits of topology control in ad hoc networks ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs ⋮ Vertex degree of random geometric graph on exponentially distributed points ⋮ A strong law for the longest edge of the minimal spanning tree ⋮ The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]

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