On zero-one laws for connectivity in one-dimensional geometric random graphs

Loading...
Thumbnail Image

Files

TR_2006-1.pdf (114.07 KB)
No. of downloads: 555

Publication or External Link

Date

2006

Advisor

Citation

DRUM DOI

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 the "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 n.

Notes

Rights