2 citations · 2 across the 3 of their papers we have counts for
Showing math.PRShow all
2 papers · 1 filter
math.PR2021
Asymptotics for Pull on the Complete Graph
Konstantinos Panagiotou, Simon Reisser
We study the randomized rumor spreading algorithm \emph{pull} on complete graphs with vertices. Starting with one informed vertex and proceeding in rounds, each vertex yet unin…
math.PR2020
Asymptotics for Push on the Complete Graph
Rami Daknama, Konstantinos Panagiotou, Simon Reisser
We study the popular randomized rumour spreading protocol Push. Initially, a node in a graph possesses some information, which is then spread in a round based manner. In each round…