Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Limit theorems in probability theory (60F99) Stopping times; optimal stopping problems; gambling theory (60G40)
Recommendations
Cited in
(79)- Randomised broadcasting: memory vs. randomness
- How fast can we reach a target vertex in stochastic temporal graphs?
- On a Daley-Kendall model of random rumours
- Noisy rumor spreading and plurality consensus
- A central limit theorem for the gossip process
- On linear-time data dissemination in dynamic rooted trees
- How to Spread Rumors Fast
- Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms
- Agent-based randomized broadcasting in large networks
- Rumor spreading in social networks
- Diffusion without false rumors: On propagating updates in a Byzantine environment.
- Rumor processes in random environment on N and on Galton-Watson trees
- Asymptotic behavior of Aldous' gossip process
- Rumor processes on \(\mathbb N\) and discrete renewal processes
- Distribution of the final extent of a rumour process
- A model for the spreading of fake news
- Faster rumor spreading with multiple calls
- Viral processes by random walks on random regular graphs
- How to run a campaign: optimal control of SIS and SIR information epidemics
- Modeling cyber rumor spreading over mobile social networks: a compartment approach
- Can the indifferent population affect the spread of rumors?
- Spread mechanism and control strategy of social network rumors under the influence of COVID-19
- Simple and optimal randomized fault-tolerant rumor spreading
- Two Markov models of the spread of rumors
- Rumor arrays
- Random coloring evolution on graphs
- How fast can we reach a target vertex in stochastic temporal graphs?
- Efficient broadcasting in random power law networks
- The String of Diamonds Is Tight for Rumor Spreading
- Rumor spreading in random evolving graphs
- Rumor source detection for rumor spreading on random increasing trees
- Continuous-time stochastic analysis of rumor spreading with multiple operations
- On the size of a rumour
- Optimal control of information epidemics modeled as Maki Thompson rumors
- Broadcasting on paths and cycles
- Information Spreading in a Large Population of Active Transmitters and Passive Receivers
- On the runtime and robustness of randomized broadcasting
- Asymptotics for push on the complete graph
- How does rumor spreading affect people inside and outside an institution
- Deterministic models for rumor transmission
- Sub-linear universal spatial gossip protocols
- Information spreading in dynamic networks: an analytical approach
- A time-randomness tradeoff for quasi-random rumour spreading
- First passage percolation on sparse random graphs with boundary weights
- How to discreetly spread a rumor in a crowd
- On broadcasting time in the model of travelling agents
- An introduction to temporal graphs: an algorithmic perspective
- Stochastic analysis of rumor spreading with multiple pull operations
- Viral processes by random walks on random regular graphs
- The state complexity of random DFAs
- How fast do rumours spread?
- An introduction to temporal graphs: an algorithmic perspective
- The worst case behavior of randomized gossip protocols
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- Quasi-random rumor spreading: reducing randomness can be costly
- Rumors' spread: a game theoretical approach with the replicator dynamics
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- Trust in cohesive communities
- On the mean absorption time of multiple coalescing particles with removal at previously visited vertices
- On randomized broadcasting in star graphs
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Expected coalescence time for a nonuniform allocation process
- Modeling and analysis of rumor spreading with social reinforcement mechanism
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Probabilistic Analysis of Rumor-Spreading Time
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting
- Total flooding time and rumor propagation on graphs
- Rumors with changing credibility
- Rumor spreading and vertex expansion
- Parsimonious flooding in dynamic graphs
- Who started this rumor? Quantifying the natural differential privacy of gossip protocols
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Breaking the \(\log n\) barrier on rumor spreading
- Communication complexity of quasirandom rumor spreading
- Asymptotics for pull on the complete graph
- On the probability of rumour survival among sceptics
- Limits for rumor spreading in stochastic populations
- On mixing and edge expansion properties in randomized broadcasting
This page was built for publication: On Spreading a Rumor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756252)
