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(log4 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]. Copyright © by SIAM.
Cite
CITATION STYLE
Chierichetti, F., Lattanzi, S., & Panconesi, A. (2010). Rumour spreading and graph conductance. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1657–1663). Association for Computing Machinery (ACM). https://doi.org/10.1137/1.9781611973075.135
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
