A very strong zero-one law for connectivity in one-dimensional geometric random graphs
- 26 February 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 11 (1) , 55-57
- https://doi.org/10.1109/lcomm.2007.061142
Abstract
We consider the geometric random graph where n points are distributed uniformly and independently on the unit interval [0, 1]. Using the method of first and second moments, we provide a simple proof of a very strong "zero-one" law for the property of graph connectivity under the asymptotic regime created by having n become large and the transmission range scaled appropriately with uKeywords
This publication has 12 references indexed in Scilit:
- Exact probability of connectivity in one-dimensional ad hoc wireless networksIEEE Communications Letters, 2006
- Meeting connectivity requirements in a wireless multihop networkIEEE Communications Letters, 2006
- Very sharp transitions in one-dimensional MANETsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Network connectivity of one-dimensional MANETs with random waypoint movementIEEE Communications Letters, 2005
- Order StatisticsWiley Series in Probability and Statistics, 2003
- On the connectivity in finite ad hoc networksIEEE Communications Letters, 2002
- Random GraphsPublished by Wiley ,2000
- Threshold Functions for Random Graphs on a Line SegmentCombinatorics, Probability and Computing, 1999
- On the connectivity of a random interval graphRandom Structures & Algorithms, 1996
- Laws of the Iterated Logarithm for Order Statistics of Uniform SpacingsThe Annals of Probability, 1981