J. Cheeger, A Lower Bound for the Smallest Eigenvalue of the Laplacian, Proceedings of the Princeton conference in honor of Professor S. Bochner, 1969.
DOI : 10.1515/9781400869312-013

P. Buser, A note on the isoperimetric constant Annales scientifiques de l'Ecole Normale Supérieure Ueber den ersten Eigenwert des Laplace- Operators auf kompakten Flächen, Commentarii Mathematici Helvetici, vol.151, issue.54, pp.477-493, 1979.
DOI : 10.1007/bf02566288

N. Alon and V. D. Milman, isoperimetric inequalities for graphs, and superconcentrators Eigenvalues and expanders, Journal of Combinatorial Theory, Series B, vol.381, issue.1 62, pp.73-88, 1985.
DOI : 10.1016/0095-8956(85)90092-9
URL : https://doi.org/10.1016/0095-8956(85)90092-9

M. Fiedler, Algebraic connectivity of graphs Czechoslovak mathematical journal 23, pp.298-305, 1973.

D. Aldous, On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing, Probability in the Engineering and Informational Sciences, pp.1-33, 1987.
DOI : 10.1126/science.220.4598.671

G. F. Lawler and A. D. Sokal, Bounds on the L 2 spectrum for Markov chains and Markov processes: a generalization of Cheeger's inequality, Transactions of the American mathematical society, vol.309, issue.2, pp.557-580, 1988.

M. Mihail, Conductance and convergence of Markov chains-a combinatorial treatment of expanders, 30th Annual Symposium on Foundations of Computer Science, 1989.
DOI : 10.1109/SFCS.1989.63529

J. Dodziuk, Difference equations, isoperimetric inequality and transience of certain random walks, Transactions of the American Mathematical Society, vol.284, issue.2, pp.787-794, 1984.
DOI : 10.1090/S0002-9947-1984-0743744-X
URL : http://www.ams.org/tran/1984-284-02/S0002-9947-1984-0743744-X/S0002-9947-1984-0743744-X.pdf

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, 1999.
DOI : 10.1145/301250.301315
URL : http://www.cs.yale.edu/HTML/YALE/CS/HyPlans/lovasz/liftst99.ps

D. Aharonov, Quantum walks on graphs, Proceedings of the thirty-third annual ACM symposium on Theory of computing , STOC '01, 2001.
DOI : 10.1145/380752.380758

L. R. Ford and D. R. Fulkerson, Maximal flow through a network, Canadian journal of Mathematics, vol.83, pp.399-404, 1956.
DOI : 10.1007/978-0-8176-4842-8_15

M. Mohseni, Environment-assisted quantum walks in photosynthetic energy transfer, The Journal of Chemical Physics, vol.17, issue.17, pp.11-603, 2008.
DOI : 10.1295/polymj.PJ2007006
URL : http://arxiv.org/pdf/0805.2741

N. John, Tsitsiklis and Michael Athans (advisor) Problems in decentralized decision making and computation, 1984.

R. Murray and R. O. Saber, Consensus protocols for networks of dynamic agents, Proc. American Control Conference, 2003.

D. J. Watts and S. H. Strogatz, Collective dynamics of ???small-world??? networks, Nature, vol.338, issue.2, pp.440-442, 1998.
DOI : 10.1038/338334a0

M. Jerrum and A. Sinclair, Approximating the Permanent, SIAM Journal on Computing, vol.18, issue.6, pp.1149-1178, 1989.
DOI : 10.1137/0218077
URL : http://www.cs.berkeley.edu/~sinclair/perm.pdf

A. Rezvanian, M. Rahmati, and M. R. Meybodi, Sampling from complex networks using distributed learning automata, Physica A: Statistical Mechanics and its Applications, vol.396, pp.224-234, 2014.
DOI : 10.1016/j.physa.2013.11.015

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

S. Aaronson, Quantum computing and hidden variables, Physical Review A, vol.114, issue.115, p.32325, 2005.
DOI : 10.1137/0204037
URL : http://arxiv.org/pdf/quant-ph/0408035

D. Aldous and J. Fill, Reversible Markov chains and random walks on graphs, 2002.

D. Levin, Y. Asher, E. L. Peres, and . Wilmer, Markov chains and mixing times, 2009.
DOI : 10.1090/mbk/058

S. Apers, A. Sarlette, and F. Ticozzi, Lifting Markov chains to mix faster: Limits and Opportunities, In preparation for IEEE Trans. Information Theory, 2017.

. Saloff-coste, J. Z. Laurent, . Touri, A. Behrouz, and . Nedi´cnedi´c, Convergence of some time inhomogeneous Markov chains via spectral techniques Stochastic processes and their applications 117 Alternative characterization of ergodicity for doubly stochastic chains, Proc. IEEE Conf. on Decision and Control, pp.961-979, 2007.

E. Mossel, Y. Peres, A. Sinclair-diaconis, A. Persi, and . Ram, Shuffling by semi-random transpositions Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques, Proc. IEEE Symp, 2000.

J. M. Hendrickx, Graph diameter, eigenvalues, and minimum-time consensus Finite-time consensus using stochastic matrices with positive diagonals, Automatica IEEE Transactions on Automatic Control, vol.502, issue.604, pp.635-640, 2014.
DOI : 10.1109/tac.2014.2352691
URL : http://arxiv.org/pdf/1302.6668

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