Geometric bounds for convergence rates of averaging algorithms
Author:
- Bernadette Charron-BostBCBernadette Charron-Bost
- 6 April 2022
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 285
Abstract
No abstract availableAll Related Versions
This publication has 18 references indexed in Scilit:
- Convergence Speed in Distributed Consensus and AveragingSIAM Review, 2011
- The Total s-Energy of a Multiagent SystemSIAM Journal on Control and Optimization, 2011
- The hitting and cover times of Metropolis walksTheoretical Computer Science, 2010
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical ApproachSIAM Journal on Control and Optimization, 2008
- Fast linear iterations for distributed averagingSystems & Control Letters, 2004
- On the k-diameter of k-regular k-connected graphsDiscrete Mathematics, 1994
- Geometric Bounds for Eigenvalues of Markov ChainsThe Annals of Applied Probability, 1991
- Approximate counting, uniform generation and rapidly mixing Markov chainsInformation and Computation, 1989
- Bounds for eigenvalues of certain stochastic matricesLinear Algebra and its Applications, 1981
- Zur Theorie der Markoffschen KettenMathematische Annalen, 1936