Dynamics of rumor spreading in complex networks

Yamir Moreno, Maziar Nekovee, and Amalio F. Pacheco
Phys. Rev. E 69, 066130 – Published 17 June 2004

Abstract

We derive the mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks. These equations are solved numerically by means of a stochastic approach. First, we present analytical and Monte Carlo calculations for homogeneous networks and compare the results with those obtained by the numerical method. Then, we study the spreading process in detail for random scale-free networks. The time profiles for several quantities are numerically computed, which allows us to distinguish among different variants of rumor spreading algorithms. Our conclusions are directed to possible applications in replicated database maintenance, peer-to-peer communication networks, and social spreading phenomena.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 4 December 2003

DOI:https://doi.org/10.1103/PhysRevE.69.066130

©2004 American Physical Society

Authors & Affiliations

Yamir Moreno1,2, Maziar Nekovee3, and Amalio F. Pacheco1,2

  • 1Departmento de Física Teórica, Universidad de Zaragoza, Zaragoza 50009, Spain
  • 2Instituto de Biocomputación y Física de Sistemas Complejos, Universidad de Zaragoza, Zaragoza 50009, Spain
  • 3Complexity Research Group, Polaris 134 BT Exact, Martlesham, Suffolk IP5 3Re, United Kingdom

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 69, Iss. 6 — June 2004

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×