Answers are grounded in this paper and cite their sources.
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
No takes yet. Share an insight, caveat, or question.
Han et al. (2007) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: