Fastest Mixing Markov Chain on a Graph
SIAM Review
A scheme for robust distributed sensor fusion based on average consensus
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Distributed average consensus with least-mean-square deviation
Journal of Parallel and Distributed Computing
Cascade RSVM in Peer-to-Peer Networks
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Distributed Kalman filtering based on consensus strategies
IEEE Journal on Selected Areas in Communications
Distributed function calculation and consensus using linear iterative strategies
IEEE Journal on Selected Areas in Communications
On matrix factorization and scheduling for finite-time average-consensus
On matrix factorization and scheduling for finite-time average-consensus
| Hi-index | 22.14 |
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called ''definitive consensus conjecture'', which states that for an undirected connected graph G with diameter D there exist D matrices whose nonzero-pattern complies with the edges in G and whose product equals the all-ones matrix. Our first result is a counterexample to the definitive consensus conjecture, which is the first improvement of the diameter lower bound for linear consensus protocols. We then provide some algebraic conditions under which this conjecture holds, which we use to establish that all distance-regular graphs satisfy the definitive consensus conjecture.