Related papers: How fast do rumours spread?
Recent years have seen various rumor diffusion models being assumed in detection of rumor source research of the online social network. Diffusion model is arguably considered as a very important and challengeable factor for source detection…
We are concerned with a class of degenerate diffusion equations with time delay describing population dynamics with age structure. In our recent study [{\em Nonlinearity}, 33 (2020), 4013--4029], we established the existence and uniqueness…
This paper gives conditions for the rightmost particle in the $n$th generation of a multitype branching random walk to have a speed, in the sense that its location divided by n converges to a constant as n goes to infinity. Furthermore, a…
We identify the asymptotic distribution of the chemical distance in high-dimensional critical Bernoulli percolation. Namely, we show that the distance between the origin and a distant vertex conditioned to lie in the cluster of the origin…
In this paper, we study PUSH-PULL style rumor spreading algorithms in the mobile telephone model, a variant of the classical telephone model in which each node can participate in at most one connection per round; i.e., you can no longer…
How does social network structure amplify or stifle behavior diffusion? Existing theory suggests that when social reinforcement makes the adoption of behavior more likely, it should spread more -- both farther and faster -- on clustered…
Front propagation in a random environment is studied close to the depinning threshold. At zero temperature we show that the depinning force distribution exhibits a universal behavior. This property is used to estimate the velocity of the…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We consider here a model of accelerating fronts, introduced in [2], consisting of one equation with nonlocal diffusion on a line, coupled via the boundary condition with a reaction-diffusion equation of the Fisher-KPP type in the upper…
Epidemic modeling has been extensively used in the last years in the field of telecommunications and computer networks. We consider the popular Susceptible-Infected-Susceptible spreading model as the metric for information spreading. In…
We study here the random diffusion model. This is a continuum model for a conserved scalar density field $\phi$ driven by diffusive dynamics. The interesting feature of the dynamics is that the {\it bare} diffusion coefficient $D$ is…
Rumor spreading on online social media is presenting a significant threat to society of post-truth epoch. Extensive efforts have been devoted to rumor identification and debunking, assuming that a specific rumor propagation is a single…
Stance classification can be a powerful tool for understanding whether and which users believe in online rumours. The task aims to automatically predict the stance of replies towards a given rumour, namely support, deny, question, or…
Rumor and information spreading are natural processes that emerge from human-to-human interaction. Mathematically, this was explored in the popular Maki-Thompson model, where a phase transition was thought to be absent. Here, we show that a…
We present a study of sound wave propagation in a time dependent random medium and an application to imaging. The medium is modeled by small temporal and spatial random fluctuations in the wave speed and density, and it moves due to an…
The asynchronous push&pull protocol, a randomized distributed algorithm for spreading a rumour in a graph $G$, works as follows. Independent Poisson clocks of rate 1 are associated with the vertices of $G$. Initially, one vertex of $G$…
We consider a supercritical catalytic branching random walk (CBRW) on a multidimensional lattice Z^d (d is positive integer). The main subject of study is the behavior of particles cloud in space and time. For CBRW on an integer line,…
We prove that the probability the cluster of the origin in a subcritical Poisson random connection model (RCM) has size at least $n$ decays exponentially as $n$ increases, under minimal assumptions. We extend a recent method of Vanneuville…
We provide a systematic study of the problem of finding the source of a rumor in a network. We model rumor spreading in a network with a variant of the popular SIR model and then construct an estimator for the rumor source. This estimator…
The Lieb-Robinson bound sets a theoretical upper limit on the speed at which information can propagate in non-relativistic quantum spin networks. In its original version, it results in an exponentially exploding function of the evolution…