Accelerating Consensus by Spectral Clustering and Polynomial Filters

It is known that polynomial filtering can accelerate the convergence toward average consensus on an undirected network. In this paper, the gain of a second-order filtering is investigated in more detail. A set of graphs is determined for which consensus can be attained in finite time, and a preconditioner is proposed to adapt the undirected weights of any given graph to achieve fastest convergence with the polynomial filter. The corresponding cost function differs from the traditional spectral gap, as it favors grouping the eigenvalues in two clusters and can favor symmetry breaking. A possible loss of robustness of the polynomial filter is also highlighted.

[1]  Soummya Kar,et al.  Finite-time distributed consensus through graph filters , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[2]  Fang Chen,et al.  Lifting Markov chains to speed up mixing , 1999, STOC '99.

[3]  Raphaël M. Jungers,et al.  Graph diameter, eigenvalues, and minimum-time consensus , 2012, Autom..

[4]  Alex Olshevsky,et al.  Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control , 2014, 1411.4186.

[5]  Radford M. Neal,et al.  ANALYSIS OF A NONREVERSIBLE MARKOV CHAIN SAMPLER , 2000 .

[6]  Ruggero Carli,et al.  Distributed Kalman filtering based on consensus strategies , 2008, IEEE Journal on Selected Areas in Communications.

[7]  Xiaojie Gao,et al.  On matrix factorization and finite-time average-consensus , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[8]  J.N. Tsitsiklis,et al.  Convergence in Multiagent Coordination, Consensus, and Flocking , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[9]  Daniel A. Spielman,et al.  Accelerated Gossip Algorithms for Distributed Computation , 2006 .

[10]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[11]  S. Muthukrishnan,et al.  First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing , 1996, Theory of Computing Systems.

[12]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[13]  Karl Henrik Johansson,et al.  Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals , 2013, IEEE Transactions on Automatic Control.

[14]  Leslie Hogben,et al.  SPECTRAL GRAPH THEORY AND THE INVERSE EIGENVALUE PROBLEM OF A GRAPH , 2005 .

[15]  Pascal Frossard,et al.  Accelerating Distributed Consensus Using Extrapolation , 2007, IEEE Signal Processing Letters.

[16]  Dirk Aeyels,et al.  Pole assignment for linear time-invariant systems by periodic memoryless output feedback , 1992, Autom..

[17]  Alain Y. Kibangou.  Finite-time average consensus based protocol for distributed estimation over AWGN channels , 2011, IEEE Conference on Decision and Control and European Control Conference.

[18]  Willem H. Haemers,et al.  Spectra of Graphs , 2011 .

[19]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[20]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[21]  Pascal Frossard,et al.  Polynomial Filtering for Fast Convergence in Distributed Consensus , 2008, IEEE Transactions on Signal Processing.

[22]  Richard M. Murray,et al.  Approximate distributed Kalman filtering in sensor networks with quantifiable performance , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[23]  Carlos Sagüés,et al.  Chebyshev Polynomials in Distributed Consensus Applications , 2011, IEEE Transactions on Signal Processing.

[24]  G. Giannakis,et al.  Kalman Filtering in Wireless Sensor Networks , 2010, IEEE Control Systems.

[25]  Aharonov,et al.  Quantum random walks. , 1993, Physical review. A, Atomic, molecular, and optical physics.

[26]  John N. Tsitsiklis,et al.  Problems in decentralized decision making and computation , 1984 .

[27]  Usman A. Khan,et al.  Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues , 2015, IEEE Signal Processing Letters.

[28]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[29]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on Graphs with Symmetries , 2007, SIAM J. Optim..

[30]  Alain Sarlette,et al.  Adding a Single State Memory Optimally Accelerates Symmetric Linear Maps , 2014, IEEE Transactions on Automatic Control.

[31]  C.N. Hadjicostis,et al.  Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies , 2007, 2007 American Control Conference.