相关论文: Stochastic rumors on random trees
Consider an Galton Watson tree of height $m$: each leaf has one of $k$ opinions or not. In other words, for $i \in \{1, . . . , k\}$, $x$ at generation $m$ thinks $i$ with probability $p_i$ and nothing with probability $p_0$. Moreover the…
The randomized rumor spreading problem generates a big interest in the area of distributed algorithms due to its simplicity, robustness and wide range of applications. The two most popular communication paradigms used for spreading the…
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…
In this paper, we present an experimental analysis of the asynchronous push & pull rumour spreading protocol. This protocol is, to date, the best-performing rumour spreading protocol for simple, scalable, and robust information…
One of the major issues in the theoretical modeling of epidemic spreading is the development of methods to control the transmission of an infectious agent. Human behavior plays a fundamental role in the spreading dynamics and can be used to…
Consider a tree network T, where each edge acts as an independent copy of a given channel M, and information is propagated from the root. For which T and M does the configuration obtained at level n of T typically contain significant…
We study a stochastic model for the diffusion of competing opinions in a population composed of three types of agents: trend-followers, opposers, and indifferent individuals. The decision dynamics are driven by reinforcement mechanisms,…
Stochastic models of evolution (Markov random fields on trivalent trees) generally assume that different characters (different runs of the stochastic process) are independent and identically distributed. In this paper we take the first…
Three types of explicit estimators are proposed here to estimate the loss rates of the links in a network of the tree topology. All of them are derived by the maximum likelihood principle and proved to be either asymptotic unbiased or…
This paper focuses on studying and understanding of stochastic dynamics in population composition when the population is subject to rumor spreading. We undertake the study by first developing an individual…
We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently the nodes of a finite ergodic graph in a discrete-time…
In earlier rumor spreading models, at each time step nodes contact all of their neighbors. In more realistic scenario it is possible that a node may contact only some of its neighbors to spread the rumor. Therefore it is must in real world…
Regression trees and random forests are popular and effective non-parametric estimators in practical applications. A recent paper by Athey and Wager shows that the random forest estimate at any point is asymptotically Gaussian; in this…
The branching-ruin number of a tree, which describes its asymptotic growth and geometry, can be seen as a polynomial version of the branching number. This quantity was defined by Collevecchio, Kious and Sidoravicius (2018) in order to…
The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to vertex. We consider two rumor processes. In the…
We present an algorithm for the problem of linear distributed estimation of a parameter in a network where a set of agents are successively taking measurements. The approach considers a roaming token in a network that carries the estimate,…
With technologies that have democratized the production and reproduction of information, a significant portion of daily interacted posts in social media has been infected by rumors. Despite the extensive research on rumor detection and…
The diffusion of rumors on microblogs generally follows a propagation tree structure, that provides valuable clues on how an original message is transmitted and responded by users over time. Recent studies reveal that rumor detection and…
Critical thinking and skepticism are fundamental mechanisms that one may use to prevent the spreading of rumors, fake-news and misinformation. We consider a simple model in which agents without previous contact with the rumor, being…
Excitation waves are studied on trees and random networks of coupled active elements. Undamped propagation of such waves is observed in those networks. It represents an excursion from the resting state and a relaxation back to it for each…