2 search results - page 1 / 1 » Two-point concentration in random geometric graphs |
COMBINATORICA
2008
13 years 11 months ago
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn Rd at random (i.i.d. according to some probability distribution with a bounded density function) and...
DIALM
2008
ACM
14 years 19 days ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...