Scaling laws for consensus protocols subject to noise
Optimization and Control
2017-03-09 v3 Distributed, Parallel, and Cluster Computing
Systems and Control
Probability
Abstract
We study the performance of discrete-time consensus protocols in the presence of additive noise. When the consensus dynamic corresponds to a reversible Markov chain, we give an exact expression for a weighted version of steady-state disagreement in terms of the stationary distribution and hitting times in an underlying graph. We then show how this result can be used to characterize the noise robustness of a class of protocols for formation control in terms of the Kemeny constant of an underlying graph.
Cite
@article{arxiv.1508.00036,
title = {Scaling laws for consensus protocols subject to noise},
author = {Ali Jadbabaie and Alex Olshevsky},
journal= {arXiv preprint arXiv:1508.00036},
year = {2017}
}