One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity

DOI10.1007/S11134-012-9298-6zbMath1275.60036OpenAlexW2089053851MaRDI QIDQ383292

Armand M. Makowski, Guang Han

Publication date: 25 November 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-012-9298-6

zbMATH Keywords

connectivitynon-uniform node distributionone-dimensional geometric random graphsvery strong zero-one laws

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Zero-one laws (60F20)

Cites Work

• Unnamed Item
• Unnamed Item
• Strong limit theorems for maximal spacings from a general univariate distribution
• The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
• Critical Density Thresholds in Distributed Wireless Networks
• Threshold Functions for Random Graphs on a Line Segment
• On the connectivity of a random interval graph
• One-Dimensional Geometric Random Graphs With Nonvanishing Densities—Part I: A Strong Zero-One Law for Connectivity
• An Introduction to Measure and Probability

This page was built for publication: One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity