DMCA
Rumour spreading and graph conductance (2010)
Cached
Download Links
by
Flavio Chierichetti
,
Silvio Lattanzi
,
Alessandro Panconesi
| Venue: | IN PROCEEDINGS OF THE 21ST ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA |
| Citations: | 33 - 2 self |
BibTeX
@INPROCEEDINGS{Chierichetti10rumourspreading,
author = {Flavio Chierichetti and Silvio Lattanzi and Alessandro Panconesi},
title = {Rumour spreading and graph conductance},
booktitle = {IN PROCEEDINGS OF THE 21ST ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA},
year = {2010},
pages = {1657--1663},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We show that if a connected graph with n nodes has conductance φ then rumour spreading, also known as randomized broadcast, successfully broadcasts a message within O(log 4 n/φ 6) many steps, with high probability, using the PUSH-PULL strategy. An interesting feature of our approach is that it draws a connection between rumour spreading and the spectral sparsification procedure of Spielman and Teng [23].
