Name
Abstract | ||
|---|---|---|
We show that the variance of the number of edges in the random sphere of influence graph built on n i.i.d. sites which are uniformly distributed over the unit cube in R-d, grows linearly with n. This is then used to establish a central limit theorem for the number of edges in the random sphere of influence graph built on a Poisson number of sites. Some related proximity graphs are discussed as well. (C) 1999 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
1999 | 3.0.CO;2-E" target="_self" class="small-link-text"10.1002/(SICI)1098-2418(199903)14:23.0.CO;2-E | Random Struct. Algorithms |
Field | DocType | Volume |
Random regular graph,Discrete mathematics,Geometric graph theory,Combinatorics,Line graph,Random graph,Cubic graph,Clebsch graph,Multiple edges,Planar graph,Mathematics | Journal | 14 |
Issue | ISSN | Citations |
2 | 1042-9832 | 1 |
PageRank | References | Authors |
0.63 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Hitczenko | 1 | 52 | 15.48 |
| Svante Janson | 2 | 1009 | 149.67 |
| J. E. Yukich | 3 | 16 | 3.47 |