M. Aizenman and R. Holley, Rapid Convergence to Equilibrium of Stochastic Ising Models in the Dobrushin Shlosman Regime, Percolation Theory and Ergodic Theory of Infinite Particle Systems Math. Applic, 1987.
DOI : 10.1007/978-1-4613-8734-3_1

R. Bubley and M. Dyer, Path coupling: A technique for proving rapid mixing in Markov chains, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.223-231, 1997.
DOI : 10.1109/SFCS.1997.646111

A. Czumaj, P. Kanarek, M. Kutylowski, and K. Lorys, Delayed path coupling and generating random permutations via distributed stochastic processes, 10 Ann. Symp. Disc. Alg, ACM-SIAM, pp.355-363, 1999.
DOI : 10.1002/1098-2418(200010/12)17:3/4<238::aid-rsa4>3.0.co;2-e

J. Ding, E. Lubetzky, and Y. Peres, The Mixing Time Evolution of Glauber Dynamics for the Mean-Field Ising Model, Communications in Mathematical Physics, vol.127, issue.2, 2008.
DOI : 10.1007/s00220-009-0781-9

R. M. Dudley, Real Analysis and Probability, 1989.
DOI : 10.1017/CBO9780511755347

M. Dyer, L. A. Goldberg, C. Greenhill, M. Jerrum, and M. Mitzenmacher, An extension of path coupling and its application to the Glauber dynamics for graph colourings, 11 Ann. Symp. Disc. Alg, ACM-SIAM, pp.616-624, 2000.

M. Dyer, C. Greenhill, and M. Molloy, Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs, Random Structures and Algorithms, vol.41, issue.1, pp.98-114, 2002.
DOI : 10.1002/rsa.10020

M. Dyer, A. Goldberg, C. Greenhill, M. Jerrum, and M. Mitzenmacher, An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings, SIAM Journal on Computing, vol.30, issue.6, pp.1962-1975, 2001.
DOI : 10.1137/S0097539700372708

C. Graham, Chaoticity on path space for a queueing network with selection of the shortest queue among several, Journal of Applied Probability, vol.28, issue.01, pp.198-210, 2000.
DOI : 10.1007/BF01199263

C. Graham, Functional central limit theorems for a large network in which customers join the shortest of several queues, Probability Theory and Related Fields, vol.64, issue.1, pp.97-120, 2004.
DOI : 10.1007/s00440-004-0372-9
URL : https://hal.archives-ouvertes.fr/hal-00001392

M. Jerrum, Mathematical foundations of MCMC, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.116-165, 1998.

M. Kac, Foundation of kinetic theory, Proc. 3rd Berkeley Symp, pp.171-197, 1956.

M. Ledoux, The Concentration of measure phenomenon, 2001.
DOI : 10.1090/surv/089

D. Levin, M. J. Luczak, and Y. Peres, Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability, Probability Theory and Related Fields, vol.33, issue.2
DOI : 10.1007/s00440-008-0189-z

M. J. Luczak and K. Marton, Transportation cost inequalities for stationary distributions of Markov kernels, 2008.

M. J. Luczak and C. Mcdiarmid, On the power of two choices: Balls and bins in continuous time, The Annals of Applied Probability, vol.15, issue.3, pp.1733-1764, 2005.
DOI : 10.1214/105051605000000205

M. J. Luczak and C. Mcdiarmid, On the maximum queue length in the supermarket model, The Annals of Probability, vol.34, issue.2, pp.493-527, 2006.
DOI : 10.1214/00911790500000710

M. J. Luczak and C. Mcdiarmid, Asymptotic distributions and chaos for the supermarket model, Electronic Journal of Probability, vol.12, issue.0, pp.75-99, 2007.
DOI : 10.1214/EJP.v12-391
URL : http://arxiv.org/abs/0712.2091

M. J. Luczak and J. R. Norris, Strong approximation for the supermarket model, The Annals of Applied Probability, vol.15, issue.3, pp.2038-2061, 2005.
DOI : 10.1214/105051605000000368
URL : http://arxiv.org/abs/math/0405183

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

M. Mitzenmacher, The power of two choices in randomized load balancing, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.10, 1996.
DOI : 10.1109/71.963420

M. Mitzenmacher, B. Prabhakar, and D. Shah, Load balancing with memory, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002.
DOI : 10.1109/SFCS.2002.1182005
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.6380

M. Mitzenmacher, A. Richa, and R. Sitaraman, The Power of Two Random Choices: A Survey of Techniques and Results, pp.255-312, 2001.
DOI : 10.1007/978-1-4615-0013-1_9

C. Mcdiarmid, Concentration, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.195-248, 1998.
DOI : 10.1007/978-3-662-12788-9_6

M. Molloy, Very rapidly mixing Markov chains for 2?-colorings and for independent sets in a graph with maximum degree 4, Random Structures and Algorithms, vol.41, issue.2, pp.101-115, 2001.
DOI : 10.1002/1098-2418(200103)18:2<101::AID-RSA1000>3.0.CO;2-D

S. T. Rachev, Probability Metrics and the Stability of Stochastic Models, Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics, 1991.

A. Sznitman, Topics in propagation of chaos InÉcoleIn´InÉcole d' ´ Eté de Probabilités de Saint-Flour XIX -1989, pp.165-251, 1989.

N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich, Queueing system with selection of the shortest of two queues: an asymptotic approach, Problems Inform. Transmission, vol.32, pp.15-27, 1996.

D. Weitz, Mixing in time and space for discrete spin systems, 2004.