Tight Bounds for Rumor Spreading with Vertex Expansion
نویسنده
چکیده
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(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.
منابع مشابه
Rumor spreading and vertex expansion
We study the relation between the rate at which rumors spread throughout a graph and the vertex expansion of the graph. We consider the standard rumor spreading protocol where every node chooses a random neighbor in each round and the two nodes exchange the rumors they know. For any n-node graph with vertex expansion α, we show that this protocol spreads a rumor from a single node to all other ...
متن کاملEstimating Time Complexity of Rumor Spreading in Ad-Hoc Networks
Rumor spreading is a fundamental communication process: given a network topology modeled by a graph and a source node with a message, the goal is to disseminate the source message to all network nodes. In this work we give a new graph-based formula that is a relatively tight estimate of the time complexity of rumor spreading in ad-hoc networks by popular Push&Pull protocol. We demonstrate its a...
متن کاملGossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading | Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | Society for Industrial and Applied Mathematics
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network, and every node is only allowed to call one neighbor in each round. In this work we introduce two fundamentally new techniques in studying the rumor spreading problem: First, we establish a new connection between the rumor spreading process in an arbitrary graph a...
متن کاملTight bounds for rumor spreading in graphs of a given conductance
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 (w.h.p.). This bound improves a recent result ...
متن کاملGossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
We study gossip algorithms for the rumor spreading problem which asks one node to deliver a rumor to all nodes in an unknown network. We present the first protocol for any expander graph G with n nodes such that, the protocol informs every node in O(log n) rounds with high probability, and uses Õ(log n) random bits in total. The runtime of our protocol is tight, and the randomness requirement o...
متن کامل