Asymptotics for pull on the complete graph
From MaRDI portal
Publication:2698490
DOI10.1016/J.SPA.2023.01.017OpenAlexW3206688652MaRDI QIDQ2698490
Simon Reisser, Konstantinos D. Panagiotou
Publication date: 24 April 2023
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09044
Applications of graph theory (05C90) Numerical solutions to stochastic differential and integral equations (65C30) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- The shortest-path problem for graphs with random arc-lengths
- On the Lambert \(w\) function
- Asynchronous rumor spreading on random graphs
- Rumor spreading in random evolving graphs
- Randomized broadcast in networks
- On Spreading a Rumor
- Some Elementary Results on Poisson Approximation in a Sequence of Bernoulli Trials
- Probability
- Rumor Spreading and Conductance
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Robustness of randomized rumour spreading
- Tight Analysis of Randomized Rumor Spreading in Complete Graphs
- How Asynchrony Affects Rumor Spreading Time
- Tight Bounds for Rumor Spreading with Vertex Expansion
- Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
- Asymptotics for push on the complete graph
This page was built for publication: Asymptotics for pull on the complete graph
