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(log 2 (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 [7] . 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.
In particular, and REF proved an O( log 2 n α ) bound and showed it to be tight as well.
Tight Bounds for Rumor Spreading with Vertex Expansion
ArXiv
ArXiv
Computer Science Mathematics