S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bull. Amer. Math. Soc. (N.S.), vol.43, issue.4, pp.439-561, 2006.

L. Massoulié, A. Kermarrec, and A. Ganesh, Network awareness and failure resilience in self-organizing overlay networks, 22nd International Symposium on Reliable Distributed Systems, 2003.

C. Cooper, R. Klasing, and T. Radzik, A randomized algorithm for the joining protocol in dynamic distributed networks, INRIA, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00342860

C. Cooper, M. Dyer, and A. J. Handley, The flip Markov chain and a randomising p2p protocol, Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, ser. PODC '09, pp.141-150, 2009.

T. Feder, A. Guetz, M. Mihail, and A. Saberi, A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks, Proceedings of the 47th

, Annual IEEE Symposium on Foundations of Computer Science, ser. FOCS '06, pp.69-76, 2006.

R. Jacob, A. Richa, C. Scheideler, S. Schmid, and H. Täubig, Skip+: A self-stabilizing skip graph, J. ACM, vol.61, issue.6, pp.1-36, 2014.

Z. A. Zhu, A. Bhaskara, S. Lattanzi, V. S. Mirrokni, and L. Orecchia, Expanders via local edge flips, CoRR, 2015.

J. Schweinsberg, An o(n2) bound for the relaxation time of a Markov chain on cladograms, Random Struct. Algorithms, vol.20, issue.1, pp.59-70, 2002.

M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput, vol.18, issue.6, pp.1149-1178, 1989.

S. Bhamidi, G. Bresler, and A. Sly, Mixing time of exponential random graphs, The Annals of Applied Probability, vol.21, issue.6, pp.2146-2170, 2011.

J. Jonasson, Mixing times for the interchange process, Alea-Latin American Journal of Probability and Mathematical Statistics, vol.9, issue.2, pp.667-683, 2012.

N. Berestycki, Mixing times of Markov chains: Techniques and examples, Alea-Latin American Journal of Probability and Mathematical Statistics, 2016.

B. Bollobas, Modern Graph Theory, 1998.

J. Friedman, J. Kahn, and E. Szemerédi, On the second eigenvalue of random regular graphs, Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, ser. STOC '89, pp.587-598, 1989.

B. Mohar, Some applications of laplace eigenvalues of graphs, Graph symmetry, pp.225-275, 1997.

D. A. Levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times, Providence, R.I. American Mathematical Society, 2009.

L. Lovász and R. Kannan, Faster mixing via average conductance, Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, ser. STOC '99, pp.282-287, 1999.

J. R. Lee, S. O. Gharan, and L. Trevisan, Multiway spectral partitioning and higher-order cheeger inequalities, J. ACM, vol.61, issue.6, pp.1-37, 2014.

D. Dubhashi and D. Ranjan, Balls and bins: a study in negative dependence, Basic Research in Computer Science, 1996.

J. Borcea, P. Brändén, and T. Liggett, Negative dependence and the geometry of polynomials, Journal of the American Mathematical Society, vol.22, issue.2, pp.521-567, 2009.

S. Boucheron, G. Lugosi, and P. Massart, Concentration Inequalities: A Nonasymptotic Theory of Independence, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00794821

N. Alon and J. H. Spencer, The Probabilistic Method, 2016.

T. Liggett, Negative correlations and particle systems, Markov Processes and Related Fields, pp.547-564, 2002.

H. K. Khalil and N. Systems, , 2002.