One-Dimensional Geometric Random Graphs With Nonvanishing Densities—Part I: A Strong Zero-One Law for Connectivity

DOI10.1109/TIT.2009.2032799zbMath1367.60009OpenAlexW2117753105MaRDI QIDQ4974117

Armand M. Makowski, Guang Han

Publication date: 8 August 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2009.2032799

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Zero-one laws (60F20)

Related Items (2)

One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity ⋮ Central limit theorems for \(U\)-statistics of Poisson point processes

This page was built for publication: One-Dimensional Geometric Random Graphs With Nonvanishing Densities—Part I: A Strong Zero-One Law for Connectivity