Asymptotics for pull on the complete graph

DOI10.1016/J.SPA.2023.01.017MaRDI QIDQ2698490zbMATH OpenOpenAlexFDO

Authors Simon Reisser, Konstantinos 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

zbMATH Keywords

asymptotic distributioncomplete graphrandomized rumor spreading

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical solutions to stochastic differential and integral equations (65C30) Randomized algorithms (68W20)

Recommendations

• Asymptotics for push on the complete graph
• Tight analysis of randomized rumor spreading in complete graphs
• Rumor spreading and conductance
• On the Push&Pull Protocol for Rumor Spreading

Cites work

• Asymptotics for push on the complete graph
• How asynchrony affects rumor spreading time
• On Spreading a Rumor
• On the Lambert \(w\) function
• On the spread of viruses on the Internet
• One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
• Probability
• Randomized broadcast in networks
• Randomized rumor spreading revisited
• Robustness of randomized rumour spreading
• Rumor spreading and conductance
• Rumor spreading in random evolving graphs
• Some Elementary Results on Poisson Approximation in a Sequence of Bernoulli Trials
• The shortest-path problem for graphs with random arc-lengths
• Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
• Tight analysis of randomized rumor spreading in complete graphs
• Tight bounds for rumor spreading with vertex expansion

Cited in

(4)

• Tight analysis of randomized rumor spreading in complete graphs
• Asymptotics for push on the complete graph
• Asymptotics for push on the complete graph
• Asymptotics for Pull on the Complete Graph

This page was built for publication: Asymptotics for pull on the complete graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698490)