Network-based consensus averaging with general noisy channels

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updates, and using the ordinary differential equation method, we prove that the updates converge almost surely to exact consensus for finite variance noise. Our analysis applies to various types of stochastic disturbances, including errors in parameters, transmission noise, and quantization noise. Under a suitable stability condition, we prove that the error is asymptotically Gaussian, and we show how the asymptotic covariance is specified by the graph Laplacian. For additive parameter noise, we show how the scaling of the asymptotic MSE is controlled by the spectral gap of the Laplacian.
Presented in part at the Allerton Conference on Control, Computing, and Communication (September 2007). Appeared as Dept. of Statistics, Technical Report, UC Berkeley

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160308

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.0438
 http://arxiv.org/abs/0805.0438

Collections

arXiv