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.

翻译：我们开发了易于计算的量来界定推和算法几乎必然指数收敛速率。我们分析了独立同分布同步八卦场景，每个智能体在每一步都向其单一目标进行通信。根据设定的普适性程度，推导了多种边界表达式，所有表达式均依赖于网络谱。尽管最通用的边界有待进一步改进，但在更多对称性条件下可建立紧密的边界，数值仿真结果证实了这一点。