Topology for Distributed Inference on Graphs

Authors:
S. Kar;S. Aldosari;J.M.F. Moura
Affiliations:
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2008

Citing 0
Cited 6

Distributed consensus algorithms in sensor networks with imperfect communication: link failures and channel noise

IEEE Transactions on Signal Processing
Distributed consensus algorithms in sensor networks: quantized data and random link failures

IEEE Transactions on Signal Processing
A distributed sensor fusion algorithm for the inversion of sparse fields

Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Weight optimization for consensus algorithms with correlated switching topology

IEEE Transactions on Signal Processing
Evolutionary optimized networks for consensus and synchronization

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Distributed estimation over complex networks

Information Sciences: an International Journal

Quantified Score

Hi-index	35.69

Visualization

Abstract

Let N decision-makers collaborate to reach a decision. We consider iterative distributed inference with local intersensor communication, which, under simplifying assumptions, is equivalent to distributed average consensus. We show that, under appropriate conditions, the topology given by the nonbipartite Ramanujan graphs optimizes the convergence rate of this distributed algorithm.