SearcharxivSearch

arXiv · 2308.05940

How fast do rumours spread?

Abstract

We study a rumour propagation model along the lines of \cite{lebensztayn2008disk} as a long-range percolation model on $\Z$. We begin by showing a sharp phase transition-type behaviour in the sense of exponential decay of the survival time of the rumour cluster in the sub-critical phase. In the super-critical phase, \update{under the assumption that radius of influence r.v. has $2+\epsilon$ moment finite (for some $\epsilon>0$)}, we show that the rightmost vertex in the rumour cluster has a deterministic speed in the sense that after appropriate scaling, the location of the rightmost vertex converges a.s.\ to a deterministic positive constant. \update{Under the assumption that radius of influence r.v. has $4+\epsilon$ moment finite,} we obtain a central limit theorem for appropriately scaled and centred rightmost vertex. Later, we introduce a rumour propagation model with reactivation. For this section, we work with a family of exponentially decaying i.i.d. radius of influence r.v.'s, and we obtain the speed result for the scaled rightmost position of the rumour cluster. Each of these results is novel, in the sense that such properties have never been established before in the context of the rumour propagation model on $\Z$, to the best of our knowledge.

Explore related subjects

Keep this discovery

BibTeXRIS

Rishideep Roy, Kumarjit Saha. 2023-08-11. How fast do rumours spread?. https://doi.org/10.1007/s10955-024-03343-3

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR