Computable convergence rate bound for ratio consensus algorithms
From MaRDI portal
Publication:6364969
arXiv2104.04802MaRDI QIDQ6364969FDOQ6364969
Authors: Balázs Gerencsér 
Publication date: 10 April 2021
Abstract: The objective of the paper is to establish a computable upper bound for the almost sure convergence rate for a class of ratio consensus algorithms defined via column-stochastic matrices. Our result extends the works of Iutzeler et al. (2013) on similar bounds that have been obtained in a more restrictive setup with limited conclusions. The present paper complements the results of Gerencs'er and Gerencs'er (2021), identifying the exact almost sure convergence rate of a wide class of ratio consensus algorithms in terms of a spectral gap, which is, however, not computable in general. The upper bound provided in the paper will be compared to the actual rate of almost sure convergence experimentally on a range of modulated random geographic graphs with random local interactions.
Ergodicity, mixing, rates of mixing (37A25) Distributed algorithms (68W15) Communication networks in operations research (90B18)
This page was built for publication: Computable convergence rate bound for ratio consensus algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364969)
