Efficient broadcast on random geometric graphs
- Los Alamos National Laboratory
- UNIV OF PADERBORN
- INTERNATIONAL COMPUTER SCI.
A Randon Geometric Graph (RGG) is constructed by distributing n nodes uniformly at random in the unit square and connecting two nodes if their Euclidean distance is at most r, for some prescribed r. They analyze the following randomized broadcast algorithm on RGGs. At the beginning, there is only one informed node. Then in each round, each informed node chooses a neighbor uniformly at random and informs it. They prove that this algorithm informs every node in the largest component of a RGG in {Omicron}({radical}n/r) rounds with high probability. This holds for any value of r larger than the critical value for the emergence of a giant component. In particular, the result implies that the diameter of the giant component is {Theta}({radical}n/r).
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC52-06NA25396
- OSTI ID:
- 990765
- Report Number(s):
- LA-UR-09-04231; LA-UR-09-4231; TRN: US201020%%578
- Resource Relation:
- Conference: ACM-SIAM Soda 2010 ; January 17, 2010 ; Austin, TX
- Country of Publication:
- United States
- Language:
- English
Similar Records
Coloring geographical threshold graphs
On the mixing time of geographical threshold graphs