A very strong zero-one law for connectivity in one-dimensional geometric random graphs

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 u

[1]  David,et al.  [Wiley Series in Probability and Statistics] Order Statistics (David/Order Statistics) || Basic Distribution Theory , 2003 .

[2]  S. Muthukrishnan,et al.  The bin-covering technique for thresholding random geometric graph properties , 2005, SODA '05.

[3]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[4]  Lachlan L. H. Andrew,et al.  Meeting connectivity requirements in a wireless multihop network , 2006, IEEE Communications Letters.

[5]  Said Nader-Esfahani,et al.  Exact probability of connectivity one-dimensional ad hoc wireless networks , 2006, IEEE Communications Letters.

[6]  Herbert A. David,et al.  Order Statistics, Third Edition , 2003, Wiley Series in Probability and Statistics.

[7]  Bu-Sung Lee,et al.  A closed form network connectivity formula one-dimensional MANETs , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[8]  W. T. Gowers,et al.  RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .

[9]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[10]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[11]  H. N. Nagaraja,et al.  Order Statistics, Third Edition , 2005, Wiley Series in Probability and Statistics.

[12]  Ashutosh Deepak Gore.  Comments on "On the connectivity in finite ad hoc networks" , 2006, IEEE Communications Letters.

[13]  Gregory L. McColm,et al.  Threshold Functions for Random Graphs on a Line Segment , 2004, Combinatorics, Probability and Computing.

[14]  M. J. Appel,et al.  The connectivity of a graph on uniform points on [0,1]d , 2002 .

[15]  L. Devroye.  Laws of the Iterated Logarithm for Order Statistics of Uniform Spacings , 1981 .

[16]  D. Manjunath,et al.  On the connectivity in finite ad hoc networks , 2002, IEEE Communications Letters.

[17]  Erhard Godehardt,et al.  On the connectivity of a random interval graph , 1996 .

[18]  Armand M. Makowski,et al.  Very sharp transitions in one-dimensional MANETs , 2006, 2006 IEEE International Conference on Communications.