Ultra-fast rumor spreading in social networks

Abstract

We analyze the popular push-pull protocol for spreading a rumor in networks. Initially, a single node knows of a rumor. In each succeeding round, every node chooses a random neighbor, and the two nodes share the rumor if one of them is already aware of it. We present the first theoretical analysis of this protocol on random graphs that have a power law… (More)

1 Figure or Table

Topics

Statistics

010202012201320142015201620172018
Citations per Year

62 Citations

Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics