E. Andjel, M. Menshikov, and V. Sisko, Positive recurrence of processes associated to crystal growth models, Annals of Applied Probability, pp.1059-1085, 2006.

J. Pieter and C. Blanc, The power-series algorithm applied to the shortest-queue model, Operations Research, vol.40, issue.1, pp.157-167, 1992.

P. Bogdan, T. Sauerwald, A. Stauffer, and H. Sun, Balls into bins via local search, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.16-34, 2013.

F. Ezanno, Systèmes de particules en interaction et modèles de déposition aléatoire, 2012.

F. Ezanno, Some results about ergodicity in shape for a crystal growth model, Electronic Journal of Probability, vol.18, issue.33, pp.1-20, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00817273

A. Ganesh, S. Lilienthal, and . Manjunath, Alexandre Proutiere, and Florian Simatos. Load balancing via random local search in closed and open systems, In ACM SIGMETRICS Performance Evaluation Review, vol.38, pp.287-298, 2010.

N. Gast, The power of two choices on graphs: the pair-approximation is accurate?, ACM SIGMETRICS Performance Evaluation Review, vol.43, issue.2, pp.69-71, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01199271

N. Gast and G. Bruno, A mean field model of work stealing in large-scale systems, ACM SIGMETRICS Performance Evaluation Review, vol.38, pp.13-24, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00788862

D. Gates and M. Westcott, Markov models of steady crystal growth, Annals of Applied Probability, pp.339-355, 1993.
DOI : 10.1214/aoap/1177005427
URL : https://doi.org/10.1214/aoap/1177005427

K. Kenthapadi and R. Panigrahy, Balanced allocation on graphs, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp.434-443, 2006.
DOI : 10.1145/1109557.1109606
URL : http://arxiv.org/pdf/cs/0510086

J. Lamperti, Criteria for the recurrence or transience of stochastic process. i, Journal of Mathematical Analysis and applications, vol.1, issue.3-4, pp.314-330, 1960.
DOI : 10.1016/0022-247x(60)90005-6
URL : https://doi.org/10.1016/0022-247x(60)90005-6

M. Mitzenmacher, The Power of Two Choices in Randomized Load Balancing, 1996.

P. Robert, Stochastic networks and queues, vol.52, 2013.
DOI : 10.1007/978-3-662-13052-0

N. Vvedenskaya, R. Dobrushin, and F. Karpelevich, Queueing system with selection of the shortest of two queues: An asymptotic approach, Problemy Peredachi Informatsii, vol.32, issue.1, pp.20-34, 1996.

G. Fayolle, V. Malyshev, and M. Menshikov, Topics in the constructive theory of countable Markov chains, 1995.

V. A. Malyshev and M. Menshikov, Ergodicity, continuity and analyticity of countable Markov chains, Trudy Moskovskogo Matematicheskogo Obshchestva, vol.39, pp.3-48, 1979.

K. Gardner, M. Harchol-balter, A. Scheller-wolf, M. Velednitsky, and S. Zbarsky, Redundancy-d: The power of d choices for redundancy, Operations Research, vol.65, issue.4, pp.1078-1094, 2017.

, For k = 2m ? 1, m ? N, for n such that |n| = k ? p, n 1 = m, n j > 0 and n l > 0 with j and l distinct