Broadcasting on paths and cycles
From MaRDI portal
Publication:2138979
Recommendations
Cites work
- Asymptotics for push on the complete graph
- How to Spread a Rumor
- How Well Do Random Walks Parallelize?
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 2046076 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 3892344 (Why is no real title available?)
- Many Random Walks Are Faster Than One
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Mean field conditions for coalescing random walks
- Multiple random walks in random regular graphs
- On an epidemic model on finite graphs
- On broadcasting time in the model of travelling agents
- On Spreading a Rumor
- On the coalescence time of reversible random walks
- On the Push&Pull Protocol for Rumor Spreading
- The shortest-path problem for graphs with random arc-lengths
- The spread of a rumor or infection in a moving population
- Tight analysis of randomized rumor spreading in complete graphs
Cited in
(4)
This page was built for publication: Broadcasting on paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138979)