Combinatorica
SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Isoperimetric Inequalities for Cartesian Products of Graphs
Combinatorics, Probability and Computing
On the spread of viruses on the internet
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Testing Expansion in Bounded-Degree Graphs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Rumor Spreading in Social Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Broadcasting vs. mixing and information dissemination on Cayley graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Proceedings of the 19th international conference on World wide web
Almost tight bounds for rumour spreading with conductance
Proceedings of the forty-second ACM symposium on Theory of computing
Reliable broadcasting in random networks and the effect of density
INFOCOM'10 Proceedings of the 29th conference on Information communications
Rumour spreading and graph conductance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading on random regular graphs and expanders
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast information spreading in graphs with large weak conductance
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Rumor spreading and vertex expansion on regular graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fast Distributed Algorithms for Computing Separable Functions
IEEE Transactions on Information Theory
The power of local information in social networks
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Strong robustness of randomized rumor spreading protocols
Discrete Applied Mathematics
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
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 nodes in [EQUATION] rounds with high probability. Further, we construct graphs for which Ω(α−1 log2 n) rounds are needed. Our results complement a long series of works that relate rumor spreading to edge-based notions of expansion, resolving one of the most natural questions on the connection between rumor spreading and expansion.