# Tight Bounds for Rumor Spreading with Vertex Expansion

arXiv: https://arxiv.org/abs/1302.6243 · HTML: https://mlsanity.com/paper/1302.6243/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Feb 2013.

## Built on by (most cited first, 1 of 1)

- [Simple Opinion Dynamics for No-Regret Learning](https://mlsanity.com/paper/2306.08670/) (2023)

## Abstract (arXiv)

We establish a bound for the classic PUSH-PULL rumor spreading protocol on arbitrary graphs, in terms of the vertex expansion of the graph. We show that O(log2(n)/α) rounds suffice with high probability to spread a rumor from a single node to all n nodes, in any graph with vertex expansion at least α. This bound matches the known lower bound, and settles the question on the relationship between rumor spreading and vertex expansion asked by Chierichetti, Lattanzi, and Panconesi (SODA 2010). Further, some of the arguments used in the proof may be of independent interest, as they give new insights, for example, on how to choose a small set of nodes in which to plant the rumor initially, to guarantee fast rumor spreading.