, Consider the process U (n) = W 5 (n)?W 4 (n) (n+2) 1?c . By Equation (19), we have for ? p (3) (x) the probability that a walker on the weighted graph G(x) first goes from N to P only using 1172 edges on the right-hand-side geodesic, The proof is divided in three steps. First step

B. Davis, Reinforced random walk. Probability Theory and Related Fields, vol.84, p.14, 1990.

M. Dorigo and T. Stützle, Ant colony optimization, 2004.

M. Duflo, Random iterative models, vol.34, p.1207, 1997.

S. Goss, S. Aron, J. Deneubourg, and J. M. Pasteels, Self-1208 organized shortcuts in the argentine ant, Naturwissenschaften, vol.76, issue.12, p.1209, 1989.

M. Ben, J. Hambly, and . Jordan, A random hierarchical lattice: the series-parallel 1210 graph and its properties, Advances in applied probability, pp.824-838, 1211.

M. Holmes and V. Kleptsyn, Proof of the warm whisker conjecture for neuronal 1212 connections, Chaos, vol.27, issue.4

B. M. Hill, D. Lane, and W. Sudderth, A strong law for some generalized urn 1214 processes, The Annals of Probability, vol.8, issue.2, p.36, 1980.

Y. Hu, B. Skyrms, and P. Tarrès, Reinforcement learning in signaling game
URL : https://hal.archives-ouvertes.fr/hal-01016556

, ArXiv preprint, 2011.

S. Janson, Limit theorems for triangular urn schemes. Probability Theory and Related 1218

. Fields, , vol.134, p.35, 2006.

D. Kious and P. Tarrès, Reinforcement learning in social networks, 2016.

C. L. Line, O. Goff, and . Raimond, Vertex reinforced non-backtracking random walks: 1222 an example of path formation, Electronic Journal of Probability, vol.23, issue.7, 2018.

F. Gregory, V. Lawler, and . Limic, Random walk: a modern introduction, vol.123

R. Lyons and Y. Peres, Probability on trees and networks, 1227.

Q. Ma, A. Johansson, A. Tero, T. Nakagaki, and D. J. Sumpter,

, Current-reinforced random walks for constructing transport networks, Journal of the Royal 1229 Society Interface, vol.10, issue.80, p.7, 2013.

R. Pemantle, A survey of random processes with reinforcement. Probability Surveys, vol.1231, p.1232, 2007.

A. Perna, B. Granovskiy, S. Garnier, C. Stamatios, M. Nicolis et al., , p.1233

G. Theraulaz, V. Fourcassié, and D. J. Sumpter, Individual rules for trail 1234 pattern formation in argentine ants (linepithema humile), PLoS Computational Biology, vol.8, issue.7, p.1002592, 1235.

R. Pemantle and S. Volkov, Vertex-reinforced random walk on z has finite range

, The Annals of Probability, vol.27, issue.3, p.1238, 1999.

C. R. Reid, D. J. Sumpter, and M. Beekman, Optimisation in a natu-1239 ral system: Argentine ants solve the towers of hanoi, Journal of Experimental Biology, vol.214, issue.1, pp.50-58, 1240.

P. Tarrès, Vertex-reinforced random walk on z eventually gets stuck on five points

, The Annals of Probability, vol.32, issue.3B, p.1243, 2004.

P. Tarrès, ;. Van-der, M. Hofstad, A. Holmes, W. Kuznetsov et al., Strongly 1246 reinforced pólya urns with graph-based competition, Localization of reinforced random walks, vol.2, pp.2494-2539, 1247.

M. Vela-pérez, A. Marco, J. J. Fontelos, and . Velázquez, Ant foraging and geodesic 1249 paths in labyrinths: Analytical and computational results, Journal of theoretical biology