The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1]d
From MaRDI portal
Publication:4361796
DOI10.2307/1428077zbMath0899.05061MaRDI 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
60D05: Geometric probability and stochastic geometry
05C80: Random graphs (graph-theoretic aspects)
60C05: Combinatorial probability
Related Items
Vertex degree of random geometric graph on exponentially distributed points, Thresholding random geometric graph properties motivated by ad hoc sensor networks, A strong law for the longest edge of the minimal spanning tree, The connectivity of a graph on uniform points on [0,\,1\(^{d}\).], Topological properties of random wireless networks, On the fundamental limits of topology control in ad hoc networks, Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs