Tight bounds for rumor spreading in graphs of a given conductance

@inproceedings{Giakkoupis2011TightBF,
  title={Tight bounds for rumor spreading in graphs of a given conductance},
  author={George Giakkoupis},
  booktitle={STACS},
  year={2011}
}
We study the connection between the rate at which a rumor spreads throughout a graph and the conductance of the graph—a standard measure of a graph’s expansion properties. We show that for any n-node graph with conductance φ, the classical PUSH-PULL algorithm distributes a rumor to all nodes of the graph in O(φ−1 log n) rounds with high probability. This bound improves a recent result of Chierichetti, Lattanzi, and Panconesi [6], and it is tight in the sense that there exist graphs where Ω(φ−1… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 112 citations. REVIEW CITATIONS
69 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 69 extracted citations

113 Citations

0102030'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…