Low complexity convergence rate bounds for the synchronous gossip subclass of push-sum algorithms

Balázs Gerencsér, Miklós Kornyik

We develop easily accessible quantities for bounding the almost sure exponential convergence rate of push-sum algorithms. We analyze the scenario of i.i.d. synchronous gossip, ever…