J. Deneubourg, S. Aron, S. Goss, and J. M. Pasteels, The self-organizing exploratory pattern of the argentine ant, Journal of Insect Behavior, vol.3, issue.2, pp.159-168, 1990.
DOI : 10.1093/aesa/79.2.283

K. Vittori, G. Talbot, J. Gautrais, V. Fourcassié, A. F. Araujo et al., Path efficiency of ant foraging trails in an artificial network, Journal of Theoretical Biology, vol.239, issue.4, pp.507-515, 2006.
DOI : 10.1016/j.jtbi.2005.08.017
URL : https://hal.archives-ouvertes.fr/hal-00093146

S. Garnier, A. Guérécheau, M. Combe, V. Fourcassié, and G. Theraulaz, Path selection and foraging efficiency in Argentine ant transport networks, Behavioral Ecology and Sociobiology, vol.400, issue.6745, pp.1167-1179, 2009.
DOI : 10.1093/pan/7.1.187

B. Davis, Reinforced random walk Probability Theory and Related Fields, pp.203-229, 1990.

P. Tarrès, Vertex-reinforced random walk on ? eventually gets stuck on five points, The Annals of Probability, vol.32, issue.3B, pp.2650-2701, 2004.
DOI : 10.1214/009117907000000694

T. Sellke, Reinforced random walk on the d-dimensional integer lattice, Markov Processes and Related Fields, pp.291-308, 2008.

V. Limic and P. Tarrès, Attracting edge and strongly edge reinforced walks, The Annals of Probability, vol.35, issue.5, pp.1783-1806, 2007.
DOI : 10.1214/009117906000001097
URL : http://arxiv.org/abs/math/0604200

M. Benaïm, O. Raimond, and B. Schapira, Strongly vertex-reinforced-random-walk on a complete graph, ALEA Lat. Am. J. Probab. Math. Stat, vol.10, issue.2, pp.767-782, 2013.

N. Madras and G. Slade, The Self-Avoiding Walk, The Self-Avoiding Walk, 1993.
DOI : 10.1007/978-1-4612-4132-4

R. Ortner and W. Woess, Non-Backtracking Random Walks and Cogrowth of Graphs, Journal canadien de math??matiques, vol.59, issue.4, pp.828-844, 2007.
DOI : 10.4153/CJM-2007-035-1

C. Cotar and D. Thacker, Edge-and vertex-reinforced random walks with super-linear reinforcement on infinite graphs, p.2017

M. Benaïm and O. Raimond, A Class of Self-Interacting Processes with Applications to Games and Reinforced Random Walks, SIAM Journal on Control and Optimization, vol.48, issue.7, pp.4707-4730, 2010.
DOI : 10.1137/080721091

R. Pemantle, Vertex-reinforced random walk, Probability Theory and Related Fields, pp.117-136, 1992.
DOI : 10.1007/BF01205239
URL : http://arxiv.org/abs/math/0404041

C. Cotar, M. Holmes, and V. Kleptsyn, Non-backtracking strongly reinforced random walk, Work in progress, 2017.

F. Schweitzer, K. Lao, and F. Family, Active random walkers simulate trunk trail formation by ants, Biosystems, vol.41, issue.3, pp.153-166, 1997.
DOI : 10.1016/S0303-2647(96)01670-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2969

A. Perna, B. Granovskiy, S. Garnier, S. C. Nicolis, M. Labédan et al., Individual Rules for Trail Pattern Formation in Argentine Ants (Linepithema humile), PLoS Computational Biology, vol.6, issue.7, p.1002592, 2012.
DOI : 10.1371/journal.pcbi.1002592.s002
URL : http://doi.org/10.1371/journal.pcbi.1002592

M. Benaïm, J. Hofbauer, and S. Sorin, Stochastic Approximations and Differential Inclusions, SIAM Journal on Control and Optimization, vol.44, issue.1, pp.328-348, 2005.
DOI : 10.1137/S0363012904439301

C. Mcdiarmid, On the method of bounded differences, Surveys in Combinatorics, pp.148-188, 1989.
DOI : 10.1017/CBO9781107359949.008

M. Benaïm, Dynamics of stochastic approximation algorithms, Séminaire de Probabilités, vol.3, issue.1, pp.1-68, 1999.
DOI : 10.1007/978-1-4757-1947-5

M. Duflo, Algorithmes stochastiques, 1996.

M. Benaïm, Vertex-reinforced random walks and a conjecture of Pemantle, The Annals of Probability, vol.25, issue.1, pp.361-392, 1997.
DOI : 10.1214/aop/1024404292