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

DOI10.2307/1428076MaRDI QIDQ4361795zbMATH OpenOpenAlexFDO

Authors 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

maximum vertex degreerandom distributionrandom graph

Mathematics Subject Classification ID

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

Cited in

(9)

• Central limit theorems for \(k\)-nearest neighbour distances
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• The maximal degree in a Poisson-Delaunay graph
• Topological properties of random wireless networks
• On the typical case complexity of graph optimization
• On covering by translates of a set
• scientific article; zbMATH DE number 7255037 (Why is no real title available?)
• Vertex degree of random geometric graph on exponentially distributed points
• Thresholding random geometric graph properties motivated by ad hoc sensor networks

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

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