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