Related papers: Stochastic rumors on random trees
We model the spread of information in a homogeneously mixed population using the Maki Thompson rumor model. We formulate an optimal control problem, from the perspective of single campaigner, to maximize the spread of information when the…
The paper considers gossip distributed estimation of a (static) distributed random field (a.k.a., large scale unknown parameter vector) observed by sparsely interconnected sensors, each of which only observes a small fraction of the field.…
In the broadcasting problem on trees, a $\{-1,1\}$-message originating in an unknown node is passed along the tree with a certain error probability $q$. The goal is to estimate the original message without knowing the order in which the…
We present results on a stochastic forest fire model, where the influence of the neighbour trees is treated in a more realistic way than usual and the definition of neighbourhood can be tuned by an additional parameter. This model exhibits…
Traditional methods for detecting rumors on social media primarily focus on analyzing textual content, often struggling to capture the complexity of online interactions. Recent research has shifted towards leveraging graph neural networks…
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…
The dynamic behaviour of stochastic spreading processes on a network model based on k-regular graphs is investigated. The contact process and the susceptible-infected-susceptible model for the spread of epidemics are considered as prototype…
The dynamics of fake news and rumor spreading is investigated using a model with three kinds of agents who are respectively the Seeds, the Agnostics and the Others. While Seeds are the ones who start spreading the rumor being adamantly…
Recent research [1] has suggested that coreness, and not degree, constitutes a better topological descriptor to identifying influential spreaders in complex networks. This hypothesis has been verified in the context of disease spreading.…
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…
A Markov tree is a random vector indexed by the nodes of a tree whose distribution is determined by the distributions of pairs of neighbouring variables and a list of conditional independence relations. Upon an assumption on the tails of…
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…
As an alternative to parsimony analyses, stochastic models have been proposed (Lewis, 2001), (Nylander, et al., 2004) for morphological characters, so that maximum likelihood or Bayesian analyses may be used for phylogenetic inference. A…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour spreads out trough an infinite number of individuals. We present sharp lower…
The study of rumor models from a percolation theory point of view has gained a few adepts in the last few years. The persistence of a rumor, which may consistently spread out throughout a population can be associated to the existence of a…
In the era of the rapid development of the Internet, the threshold for information spreading has become lower. Most of the time, rumors, as a special kind of information, are harmful to society. And once the rumor appears, the truth will…
By introducing the notions of living and dead nodes a new model of random tree evolution with continuous time parameter has been constructed. It is assumed that two random variables, the lifetime and the offspring number of living nodes…
For a uniform random labelled tree, we find the limiting distribution of tree parameters which are stable (in some sense) with respect to local perturbations of the tree structure. The proof is based on the martingale central limit theorem…
The spread of ideas in online social networks is a crucial phenomenon to understand nowadays the proliferation of fake news and their impact in democracies. This makes necessary to use models that mimic the circulation of rumors. The law of…
We give examples of data-generating models under which Breiman's random forest may be extremely slow to converge to the optimal predictor or even fail to be consistent. The evidence provided for these properties is based on mostly intuitive…