Search
Now showing items 1-1 of 1
Connectivity in one-dimensional geometric random graphs: Poisson approximations, zero-one laws and phase transitions
(2008-10-24)
Consider n points (or nodes) distributed uniformly and independently on the unit interval [0,1]. Two nodes are said to be adjacent if their distance is less than some given threshold value.For the underlying random graph ...