Vertex reinforced non-backtracking random walks: an example of path formation

DOI10.1214/18-EJP167zbMath1430.60086arXiv1506.01239OpenAlexW2963163894MaRDI QIDQ1748948

Olivier Raimond, Line C. Le Goff

Publication date: 15 May 2018

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.01239

zbMATH Keywords

complete graphnon-backtracking random walkspath formationvertex reinforced random walk

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Stochastic processes (60G99) Social and behavioral sciences: general topics (91C99)

Related Items (3)

Finding geodesics on graphs using reinforcement learning ⋮ The directed edge reinforced random walk: the Ant Mill phenomenon ⋮ The trace-reinforced ants process does not find shortest paths

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamics of vertex-reinforced random walks
• The self-avoiding walk.
• Vertex-reinforced random walk
• Vertex-reinforced random walks and a conjecture of Pemantle
• Vertex-reinforced random walk on \(\mathbb Z\) eventually gets stuck on five points.
• Stochastic algorithms
• Path efficiency of ant foraging trails in an artificial network
• Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs
• Attracting edge and strongly edge reinforced walks
• Strongly Vertex-Reinforced-Random-Walk on the complete graph
• A Class of Self-Interacting Processes with Applications to Games and Reinforced Random Walks
• Non-Backtracking Random Walks and Cogrowth of Graphs
• Stochastic Approximations and Differential Inclusions
• Reinforced random walk

This page was built for publication: Vertex reinforced non-backtracking random walks: an example of path formation