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

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.
DOI : 10.1137/1.9781611973105.2

URL : http://www.mpi-inf.mpg.de/~hsun/1207.2125v1.pdf

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

F. Ezanno, Some results about ergodicity in shape for a crystal growth model, Electronic Journal of Probability, vol.18, issue.0, pp.1-20, 2013.
DOI : 10.1214/EJP.v18-2177

URL : https://hal.archives-ouvertes.fr/hal-00817273

N. Gast, The Power of Two Choices on Graphs, ACM SIGMETRICS Performance Evaluation Review, vol.43, issue.2, pp.69-71, 2015.
DOI : 10.1038/nature04605

URL : https://hal.archives-ouvertes.fr/hal-01199271

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

K. Kenthapadi and R. Panigrahy, Balanced allocation on graphs, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, 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

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

P. Robert, Stochastic networks and queues, 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.

?. Ni=j-with-i, ·. ·. {1, N. , and ?. , plugging f (n + e i ) = 1 ni=j?1 and f (n ? e i ) = 1 ni=j+1 in equation (4) gives, first for j = 0, Lf (n) = ??, pp.0-0