Related papers: How fast do rumours spread?
The study of crossing probabilities - i.e. probabilities of existence of paths crossing rectangles - has been at the heart of the theory of two-dimensional percolation since its beginning. They may be used to prove a number of results on…
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d.~heavy-tailed passage times on edges.…
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 empirically analyze two versions of the well-known "randomized rumor spreading" protocol to disseminate a piece of information in networks. In the classical model, in each round each informed node informs a random neighbor. In the…
The spread of rumors in online networks threatens public safety and results in economic losses. To overcome this problem, a lot of work studies the problem of rumor control which aims at limiting the spread of rumors. However, all previous…
Randomized gossip is one of the most popular way of disseminating information in large scale networks. This method is appreciated for its simplicity, robustness, and efficiency. In the "push" protocol, every informed node selects, at every…
We propose an SIS competition model describing the propagation of conflicting rumors, such as fake news and its corrections. This simple model captures the interaction between rumor propagation and opinion dynamics, where rumors drive…
We introduce a model for the spreading of epidemics by long-range infections and investigate the critical behaviour at the spreading transition. The model generalizes directed bond percolation and is characterized by a probability…
Much research has been done on studying the diffusion of ideas or technologies on social networks including the \textit{Influence Maximization} problem and many of its variations. Here, we investigate a type of inverse problem. Given a…
The empirical velocity of a reaction-diffusion front, propagating into an unstable state, fluctuates because of the shot noises of the reactions and diffusion. Under certain conditions these fluctuations can be described as a diffusion…
Diffusion of information in networks is at the core of many problems in AI. Common examples include the spread of ideas and rumors as well as marketing campaigns. Typically, information diffuses at a non-linear rate, for example, if markets…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…
A bootstrap percolation process on a graph with infection threshold $r\ge 1$ is a dissemination process that evolves in time steps. The process begins with a subset of infected vertices and in each subsequent step every uninfected vertex…
The propagation of light in a scattering medium is described as the motion of a special kind of a Brownian particle on which the fluctuating forces act only perpendicular to its velocity. This enforces strictly and dynamically the…
This paper studies the critical and near-critical regimes of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4]$ using novel coupling techniques. More precisely, we derive the scaling relations between the…
We propose a realistic generalization of the Maki-Thompson rumour model by assuming that each spreader ceases to propagate the rumour right after being involved in a random number of stifling experiences. We consider the process with a…
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…
Interactions between commuting individuals can lead to large-scale spreading of rumors, ideas, or disease, even though the commuters have no net displacement. The emergent dynamics depend crucially on the commuting distribution of a…
Many real-world networks display a community structure. We study two random graph models that create a network with similar community structure as a given network. One model preserves the exact community structure of the original network,…
Models of meme propagation on social networks, in which memes compete for limited user attention, can successfully reproduce the heavy-tailed popularity distributions observed in online settings. While system-wide popularity distributions…