相关论文: How fast do rumours spread?
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bounds for its run-time were proven. This prompts the…
Despite the increasing use of social media platforms for information and news gathering, its unmoderated nature often leads to the emergence and spread of rumours, i.e. pieces of information that are unverified at the time of posting. At…
The rapid diffusion of information and the adoption of social behaviors are of critical importance in situations as diverse as collective actions, pandemic prevention, or advertising and marketing. Although the dynamics of large cascades…
This paper introduces a run-and-tumble model with self-reinforcing directionality and rests. We derive a single governing hyperbolic partial differential equation for the probability density of random walk position, from which we obtain the…
A model-based description of the scaling and radial location of turbulent fluctuations in turbulent pipe flow is presented and used to illuminate the scaling behaviour of the very large scale motions. The model is derived by treating the…
For the classical reaction diffusion equation, the priori speed of fronts is determined exactly in the pioneering paper (R.D. Benguria and M.C. Depassier, {\em Commun. Math. Phys.} 175:221--227, 1996) by variational characterization method.…
This paper is concerned with the long-time dynamics of an epidemic model whose diffusion and reaction terms involve nonlocal effects described by suitable convolution operators, and the epidemic region is represented by an evolving interval…
We place constraints on the propagation velocity of bulk turbulence within the intracluster medium of three clusters and an elliptical galaxy. Using Reflection Grating Spectrometer measurements of turbulent line broadening, we show that for…
Recent empirical studies have confirmed the key roles of complex contagion mechanisms such as memory, social reinforcement, and decay effects in information diffusion and behaviour spreading. Inspired by this fact, we here propose a new…
We reconsider the problem of diffusion of particles at constant speed and present a generalization of the Telegrapher process to higher dimensional stochastic media ($d>1$), where the particle can move along $2^d$ directions. We derive the…
I find that several models for information sharing in social networks can be interpreted as age-dependent multi-type branching processes, and build them independently following Sewastjanow. This allows to characterize criticality in (real…
Many of today's most pressing issues require a more robust understanding of how information spreads in populations. Current models of information spread can be thought of as falling into one of two varieties: epidemiologically-inspired…
We propose a brand-new formalism for the propagation of relativistic cosmic ray (CR) particles. The propagation of CRs has often been described using the diffusion approximation, which has the drawback that the propagation speed of CRs near…
We consider biased random walks in a one-dimensional percolation model. This model goes back to Axelson-Fisk and H\"aggstr\"om and exhibits the same phase transition as biased random walk on the infinite cluster of supercritical Bernoulli…
The massive diffusion of online social media allows for the rapid and uncontrolled spreading of conspiracy theories, hoaxes, unsubstantiated claims, and false news. Such an impressive amount of misinformation can influence policy…
Rumour spreading is a protocol for modelling the spread of information through a network via user-to-user interaction. The Spatial Preferred Attachment (SPA) model is a random graph model for complex networks: vertices are placed in a…
The paper addresses a method for spreading messages in social networks through an initial acceleration by Spreading Groups. These groups start the spread which eventually reaches a larger portion of the network. The use of spreading groups…
We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…
We consider the following multi--level opinion spreading model on networks. Initially, each node gets a weight from the set [0..k-1], where such a weight stands for the individuals conviction of a new idea or product. Then, by proceeding to…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…