Related papers: Critical threshold and dynamics of a general rumor…
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…
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…
In earlier rumor spreading models, at each time step nodes contact all of their neighbors. In more realistic scenario it is possible that a node may contact only some of its neighbors to spread the rumor. Therefore it is must in real world…
Rumor models consider that information transmission occurs with the same probability between each pair of nodes. However, this assumption is not observed in social networks, which contain influential spreaders. To overcome this limitation,…
We analyze the spreading of viruses in scale-free networks with high clustering and degree correlations, as found in the Internet graph. For the Suscetible-Infected-Susceptible model of epidemics the prevalence undergoes a phase transition…
Anti-rumor dynamics is proposed on the basis of rumor dynamics and the characteristics of anti-rumor dynamics are explored by both mean-field equations and numerical simulations on complex network. The main metrics we study are the timing…
We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold…
Scale-free (SF) network structures observed in many complex systems affect the size of epidemic spreading and the efficiency of communication, statistical properties of the degree-degree correlations are important for studying the average…
The Internet, as well as many other networks, has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the…
Spreading phenomena are ubiquitous in nature and society. For example, disease, rumor, and information spread over underlying social and information networks. It is well known that there is no threshold for epidemic models on scale-free…
The rapid spread of information and rumors through social media platforms, especially in group settings, motivates the need for more sophisticated models of rumor propagation. Traditional pairwise models do not account for group…
We show that a simple model for the propagation of a rumor on a small-world network exhibits critical behavior at a finite randomness of the underlying graph. The transition occurs between a regime where the rumor "dies" in a small…
We introduce the generalized rumor spreading model and investigate some properties of this model on different complex social networks. Despite pervious rumor models that both the spreader-spreader ($SS$) and the spreader-stifler ($SR$)…
We study the dynamics of an epidemic-like model for the spread of a rumor on a small-world network. It has been shown that this model exhibits a transition between regimes of localization and propagation at a finite value of the network…
Disease and information spread over social and information networks. Understanding the spread phenomena in networks requires paying attention not only to the degree distribution but also to the degree correlation. However, it is considered…
Connectivity correlations play an important role in the structure of scale-free networks. While several empirical studies exist, there is no general theoretical analysis that can explain the largely varying behavior of real networks. Here,…
It is generally accepted that scale-free networks is prone to epidemic spreading allowing the onset of large epidemics whatever the spreading rate of the infection. In the paper, we show that disease propagation may be suppressed in…
The asynchronous rumor algorithm spreading propagates a piece of information, the so-called rumor, in a network. Starting with a single informed node, each node is associated with an exponential time clock with rate $1$ and calls a random…
The spread of a disease, a computer virus or information is discussed in a directed complex network. We are concerned with a steady state of the spread for the SIR and SIS dynamic models. In a scale-free directed network it is shown that…
Epidemics on complex networks is a widely investigated topic in the last few years, mainly due to the last pandemic events. Usually, real contact networks are dynamic, hence much effort has been invested in studying epidemics on evolving…