Dynamics of rumor spreading in complex networks.

By Yamir Moreno, Maziar M. Nekovee, A. F. Pacheco. Physical review. E, Statistical, nonlinear, and soft matter physics, 2003

875 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/01cc1a810897f9ff70929b4c62696668d05213b7

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Statistical and Nonlinear Physics

Citations in the corpus

Virality Prediction and Community Structure in Social Networks (2013, background): “Network structure can greatly aﬀect the spreading process [15,26,27]; for example, infections with small spreading rate persist in scale-free networks [8].”
Networks beyond pairwise interactions: structure and dynamics (2020, background): “In their model, placed within the framework of rumor spreading [487, 488], individuals are divided into the three standard classes corresponding to ignorant (S), spreader (I), and stifler nodes (R).”
Impact of human activity patterns on the dynamics of information diffusion. (2007, positive): “Most understanding comes from implementing models and ideas borrowed from epidemiology on empirical or synthetic social networks [1, 6].”
Navigable networks as Nash equilibria of navigation games (2014, neutral): “(16) for δ ∈ [10−6, 10−3] and R = [12, 18].”
Recommender Systems (2012, background): “In [259], the authors proposed a model where the recommended items spread over the network similarly as an epidemics [64,260] or rumor [10,261] spreads in a society.”
Dynamics of information diffusion and its applications on complex networks (2016, background): “Numerous studies also considered rumor dynamics on scale-free networks [270,271].”
Theory of Rumour Spreading in Complex Social Networks (2007, methodology): “studied the stochastic version of the MK model on scale-free networks, by means of Monte Carlo simulations [21], and numerical solution of a set of mean-field equations [22].”