Theory of Rumour Spreading in Complex Social Networks

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behavior and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet.

💡 Research Summary

The paper proposes a stochastic framework for rumor propagation on complex social networks, especially those mediated by the Internet. The authors define three node states—ignorant (never heard the rumor), spreader (actively transmitting), and stifler (knows the rumor but no longer spreads it). Two elementary reactions drive the dynamics: (i) a spreader contacts an ignorant node, turning the ignorant into a spreader with rate λ, and (ii) a spreader contacts either another spreader or a stifler, causing the initiating spreader to become a stifler with rate α. By averaging over ensembles of nodes with the same degree k, the authors derive mean‑field equations that explicitly contain the degree distribution P(k) and the conditional degree‑degree correlation P(k′|k).

The analysis proceeds in three network settings. First, for homogeneous networks and Erdős‑Rényi random graphs, the degree distribution is narrow, so the dynamics are governed mainly by the average degree ⟨k⟩. The mean‑field treatment yields a critical spreading rate λ_c = α/⟨k⟩. If λ < λ_c, any rumor dies out after a few contacts; if λ > λ_c, a macroscopic fraction of the population eventually hears the rumor. Numerical simulations on graphs of up to 10⁶ nodes confirm the existence of this sharp threshold.

Second, the authors turn to uncorrelated scale‑free networks with a power‑law degree distribution P(k) ∝ k^−γ (2 < γ ≤ 3). In such networks the second moment ⟨k²⟩ diverges with system size, which drives the critical threshold λ_c ≈ α⟨k⟩/⟨k²⟩ toward zero as N → ∞. Consequently, even an infinitesimally small λ can trigger a global outbreak in the thermodynamic limit. This “vanishing threshold” mirrors results from epidemic modeling and explains why online platforms with scale‑free connectivity are especially vulnerable to rapid rumor spread.

Third, the paper investigates the effect of degree correlations by constructing assortative scale‑free networks where high‑degree nodes preferentially connect to other high‑degree nodes. The mean‑field equations now contain the joint degree distribution, and the initial exponential growth rate becomes r ≈ λ⟨k²⟩/⟨k⟩, which is amplified relative to the uncorrelated case. Simulations show that assortativity dramatically speeds up the early phase of rumor diffusion. However, the final fraction of nodes that ever hear the rumor, R_∞, exhibits a non‑monotonic dependence on assortativity: for low λ the presence of hubs that quickly become stiflers can suppress the overall reach, whereas for high λ the same hub‑hub connectivity sustains the spread and raises R_∞. This nuanced behavior arises from the interplay between the rate at which spreaders are “quenched” and the structural reinforcement provided by hub clusters.

The authors validate the analytical predictions with extensive Monte‑Carlo simulations across the three network families, varying λ and α over several orders of magnitude. The agreement is excellent, confirming that the mean‑field approximation captures both the threshold phenomena and the detailed time evolution of the rumor density.

Beyond the theoretical contributions, the paper discusses practical implications. In contexts such as chain‑email mitigation, viral marketing, or public‑information campaigns, targeting high‑degree nodes (hubs) for early inoculation (turning them into stiflers) can dramatically reduce the eventual spread in scale‑free environments. Conversely, marketers can exploit the same hub structure to accelerate diffusion by seeding the rumor on well‑connected individuals, especially when the underlying network exhibits assortative mixing.

In summary, this work extends classic rumor models by incorporating realistic network topologies and degree correlations, derives closed‑form mean‑field equations, and demonstrates that scale‑free, assortatively mixed social networks are intrinsically prone to rapid and extensive rumor propagation. The findings bridge epidemiology, information science, and network engineering, offering a robust analytical toolkit for both understanding and controlling large‑scale information cascades on the modern Internet.