J. N. Tsitsiklis, Problems in decentralized decision making and computation, 1984.

S. Boyd, P. Diaconis, and L. Xiao, Fastest Mixing Markov Chain on a Graph, SIAM Review, vol.46, issue.4, pp.667-689, 2004.
DOI : 10.1137/S0036144503423264

F. Chen, L. Lovász, and I. Pak, Lifting Markov chains to speed up mixing, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, pp.275-281, 1999.
DOI : 10.1145/301250.301315

J. N. Tsitsiklis, D. P. Bertsekas, and M. Athans, Distributed asynchronous deterministic and stochastic gradient optimization algorithms, IEEE Transactions on Automatic Control, vol.31, issue.9, pp.803-812, 1986.
DOI : 10.1109/TAC.1986.1104412

A. Ribeiro, I. D. Schizas, S. Roumeliotis, and G. B. Giannakis, Kalman Filtering in Wireless Sensor Networks, IEEE Control Systems Magazine, vol.30, issue.2, pp.66-86, 2010.
DOI : 10.1109/MCS.2009.935569

D. P. Spanos, R. Olfati-saber, and R. M. Murray, Approximate distributed kalman filtering in sensor networks with quantifiable performance, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005., p.18, 2005.
DOI : 10.1109/IPSN.2005.1440912

R. Carli, A. Chiuso, L. Schenato, and S. Zampieri, Distributed Kalman filtering based on consensus strategies, Selected Areas in Communications, pp.622-633, 2008.
DOI : 10.1109/JSAC.2008.080505

W. Ren, R. W. Beard, and E. M. Atkins, A survey of consensus problems in multi-agent coordination, American Control Conference Proceedings of the 2005, pp.1859-1864, 2005.

V. Blondel, J. M. Hendrickx, A. Olshevsky, and J. Tsitsiklis, Convergence in Multiagent Coordination, Consensus, and Flocking, Proceedings of the 44th IEEE Conference on Decision and Control, p.2996, 1998.
DOI : 10.1109/CDC.2005.1582620

R. Olfati-saber, A. Fax, and R. M. Murray, Consensus and Cooperation in Networked Multi-Agent Systems, Proceedings of the IEEE, vol.95, issue.1, pp.215-233, 2007.
DOI : 10.1109/JPROC.2006.887293

L. Xiao and S. Boyd, Fast linear iterations for distributed averaging, Systems & Control Letters, vol.53, issue.1, pp.65-78, 2004.
DOI : 10.1016/j.sysconle.2004.02.022

S. Muthukrishnan, B. Ghosh, and M. H. Schultz, First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing, Theory of Computing Systems, vol.31, issue.4, pp.331-354, 1998.
DOI : 10.1007/s002240000092

E. Montijano, J. I. Montijano, and C. Sagues, Chebyshev Polynomials in Distributed Consensus Applications, IEEE Transactions on Signal Processing, vol.61, issue.3, pp.693-706, 2013.
DOI : 10.1109/TSP.2012.2226173

J. M. Hendrickx, R. M. Jungers, A. Olshevsky, and G. Vankeerberghen, Graph diameter, eigenvalues, and minimum-time consensus, Automatica, vol.50, issue.2, pp.635-640, 2014.
DOI : 10.1016/j.automatica.2013.11.034

L. Hogben, Spectral graph theory and the inverse eigenvalue problem of a graph, Electronic Journal of Linear Algebra, vol.14, issue.1, p.3, 2005.
DOI : 10.13001/1081-3810.1174

A. Olshevsky, Linear time average consensus on fixed graphs and implications for decentralized optimization and multi-agent control ArXiv e-prints, 2014.

M. Cao, D. A. Spielman, and E. M. Yeh, Accelerated gossip algorithms for distributed computation, Proc. of the 44th Annual Allerton Conference on Communication, Control, and Computation. Citeseer, pp.952-959, 2006.

A. Sarlette, Adding a single memory per agent gives the fastest average consensus, IEEE Trans. Automatic Control, 2014.

P. Diaconis, S. Holmes, and R. M. Neal, Analysis of a nonreversible Markov chain sampler, The Annals of Applied Probability, vol.10, issue.3, pp.726-752, 2000.
DOI : 10.1214/aoap/1019487508

J. M. Hendrickx, G. Shi, and K. H. Johansson, Finite-Time Consensus Using Stochastic Matrices With Positive Diagonals, IEEE Transactions on Automatic Control, vol.60, issue.4, pp.1070-1073, 2015.
DOI : 10.1109/TAC.2014.2352691

A. Y. Kibangou, Finite-time average consensus based protocol for distributed estimation over AWGN channels, IEEE Conference on Decision and Control and European Control Conference, pp.5595-5600, 2011.
DOI : 10.1109/CDC.2011.6160868

S. Safavi and U. Khan, Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues, IEEE Signal Processing Letters, vol.22, issue.1, pp.54-57, 2015.
DOI : 10.1109/LSP.2014.2346657

C. Ko and X. Gao, On matrix factorization and finite-time averageconsensus, 28th Chinese Control Conference Proceedings of the 48th IEEE Conference, pp.5798-5803, 2009.

A. Sandryhaila, S. Kar, and J. M. Moura, Finite-time distributed consensus through graph filters, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.1080-1084, 2014.
DOI : 10.1109/ICASSP.2014.6853763

S. Sundaram and C. N. Hadjicostis, Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies, 2007 American Control Conference, pp.711-716, 2007.
DOI : 10.1109/ACC.2007.4282726

E. Kokiopoulou and P. Frossard, Accelerating Distributed Consensus Using Extrapolation, IEEE Signal Processing Letters, vol.14, issue.10, pp.665-668, 2007.
DOI : 10.1109/LSP.2007.896383

A. E. Brouwer and W. H. Haemers, Spectra of graphs, 2011.
DOI : 10.1007/978-1-4614-1939-6

S. Boyd, P. Diaconis, P. Parrilo, and L. Xiao, Fastest Mixing Markov Chain on Graphs with Symmetries, SIAM Journal on Optimization, vol.20, issue.2, pp.792-819, 2009.
DOI : 10.1137/070689413

D. Aeyels and J. L. Willems, Pole assignment for linear time-invariant systems by periodic memoryless output feedback, Automatica, vol.28, issue.6, pp.1159-1168, 1992.
DOI : 10.1016/0005-1098(92)90057-M

Y. Aharonov, L. Davidovich, and N. Zagury, Quantum random walks, Physical Review A, vol.48, issue.2, p.1687, 1993.
DOI : 10.1103/PhysRevA.48.1687