Search
Now showing items 1-2 of 2
A strong zero-one law for connectivity in one-dimensional geometric random graphs with non-vanishing densities
(2007)
We consider the geometric random graph where n points are distributed independently on the unit interval [0,1] according to some probability distribution function F. Two nodes communicate with each other if their distance ...
On the critical communication range under node placement with vanishing densities
(2007)
We consider the random network where n points are placed independently on the unit interval [0, 1] according to some probability distribution function F. Two nodes communicate with each other if their distance is less than ...