相关论文: Rumor processes in random environment on N and on …
In this paper, we study a birth and death process $\{N_t\}_{t\ge0}$ on positive half lattice, which at each discontinuity jumps at most a distance $R\ge 1$ to the right or exactly a distance $1$ to the left. The transitional probabilities…
In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…
Warning Propagation is a combinatorial message passing algorithm that unifies and generalises a wide variety of recursive combinatorial procedures. Special cases include the Unit Clause Propagation and Pure Literal algorithms for…
We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either inflammable, fireproof, or burt. Every inflammable edge is replaced by a fireproof edge at unit rate, while fires start at…
We explore the survival function for percolation on Galton-Watson trees. Letting $g(T,p)$ represent the probability a tree $T$ survives Bernoulli percolation with parameter $p$, we establish several results about the behavior of the random…
We consider a two-dimensional time-inhomogeneous birth-death process to model the time-evolution of fake news in a population. The two components of the process represent, respectively, (i) the number of individuals (say spreaders) who know…
The spread of rumors, which are known as unverified statements of uncertain origin, may cause tremendous number of social problems. If it would be possible to identify factors affecting spreading a rumor (such as agents' desires, trust…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
We revisit the problem of broadcasting on $d$-ary trees: starting from a Bernoulli$(1/2)$ random variable $X_0$ at a root vertex, each vertex forwards its value across binary symmetric channels $\mathrm{BSC}_\delta$ to $d$ descendants. The…
The dynamics of spreading of the minority opinion in public debates (a reform proposal, a behavior change, a military retaliation) is studied using a diffusion reaction model. People move by discrete step on a landscape of random geometry…
We study the randomized rumor spreading algorithm \emph{pull} on complete graphs with $n$ vertices. Starting with one informed vertex and proceeding in rounds, each vertex yet uninformed connects to a neighbor chosen uniformly at random and…
The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…
Consider a rooted $N$-ary tree. To every vertex of this tree, we attach an i.i.d. continuous random variable. A vertex is called accessible if along its ancestral line, the attached random variables are increasing. We keep accessible…
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.…
In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are…
The rapid spread of rumors in social media is mainly caused by individual retweets. This paper applies uncertainty time series analysis (UTSA) to analyze a rumor retweeting behavior on Weibo. First, the rumor forwarding is modeled using…
We introduce and study the problem of posterior inference on tree-structured graphical models in the presence of a malicious adversary who can corrupt some observed nodes. In the well-studied broadcasting on trees model, corresponding to…
Looptrees have recently arisen in the study of critical percolation on the uniform infinite planar triangulation. Here we consider random infinite looptrees defined as the local limit of the looptree associated with a critical…
We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…
We consider a branching random walk (BRW) taking its values in the $\mathtt{b}$-ary rooted tree $\mathbb W_{ \mathtt{b}}$ (i.e. the set of finite words written in the alphabet $\{ 1, \ldots, \mathtt{b} \}$, with $\mathtt{b}\! \geq \! 2$).…