Topology for Distributed Inference on Graphs

Soummya Kar, Saeed Abdullah Aldosari, José M. F. Moura · IEEE Transactions on Signal Processing · 2008

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.

Read the paper · More papers on PaperTik