Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 26 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 470 tok/s Pro
Kimi K2 216 tok/s Pro
2000 character limit reached

Vertex reinforced non-backtracking random walks: an example of path formation (1506.01239v3)

Published 3 Jun 2015 in math.PR

Abstract: This article studies vertex reinforced random walks that are non-backtracking (denoted VRNBW), i.e. U-turns forbidden. With this last property and for a strong reinforcement, the emergence of a path may occur with positive probability. These walks are thus useful to model the path formation phenomenon, observed for example in ant colonies. This study is carried out in two steps. First, a large class of reinforced random walks is introduced and results on the asymptotic behavior of these processes are proved. Second, these results are applied to VRNBWs on complete graphs and for reinforced weights $W(k)=k\alpha$, with $\alpha\ge 1$. It is proved that for $\alpha>1$ and $3\le m< \frac{3\alpha -1}{\alpha-1}$, the walk localizes on $m$ vertices with positive probability, each of these $m$ vertices being asymptotically equally visited. Moreover the localization on $m>\frac{3\alpha -1}{\alpha-1}$ vertices is a.s. impossible.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.