On the Zero-One Laws for Connectivity in One-Dimensional Geometric Random Graphs
Technical research rept.
MARYLAND UNIV COLLEGE PARK DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
Pagination or Media Count:
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.
- Electrical and Electronic Equipment