Rumor Processes on N
From MaRDI portal
Publication:3094681
DOI10.1239/jap/1316796903zbMath1231.60113arXiv1011.0355MaRDI QIDQ3094681
Valdivino Vargas Junior, Mauricio Zuluaga, Fábio Prates Machado
Publication date: 25 October 2011
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.0355
60G50: Sums of independent random variables; random walks
60K35: Interacting random processes; statistical mechanics type models; percolation theory
Related Items
Frog models on trees through renewal theory, A model for the spreading of fake news, A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model, Local and Global Survival for Nonhomogeneous Random Walk Systems on Z, Rumors' spread: a game theoretical approach with the replicator dynamics, On the probability of rumour survival among sceptics, Can the indifferent population affect the spread of rumors?, A spatial stochastic model for rumor transmission, The cone percolation on \(\mathbb{T}_{d}\), The cone percolation model on Galton-Watson and on spherically symmetric trees, Rumour propagation among sceptics: the Markovian case, Discrete one-dimensional coverage process on a renewal process, On rumour propagation among sceptics, Rumor processes in random environment on \(\mathbb N\) and on Galton-Watson trees, Rumor processes on \(\mathbb N\) and discrete renewal processes, Stochastic spatial model for the division of labor in social insects, The Rumor Percolation Model and Its Variations
Cites Work
- The disk-percolation model on graphs
- The exact solution of the general stochastic rumour.
- The spread of a rumor or infection in a moving population
- On a Daley-Kendall model of random rumours
- Word of Mouth: Rumor Dissemination in Social Networks
- Critical Behaviors and Critical Values of Branching Random Walks on Multigraphs
- Percolation
- On the coverage of space by random sets
- The proportion of the population never hearing a rumour
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item