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

07/12/2023
by   Balázs Gerencsér, et al.
0

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, every agent communicating towards its single target at every step. Multiple bounding expressions are developed depending on the generality of the setup, all functions of the spectrum of the network. While the most general bound awaits further improvement, with more symmetries, close bounds can be established, as demonstrated by numerical simulations.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset