Strongly Vertex-Reinforced-Random-Walk on the complete graph

Abstract

We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form $w(n)=n^{\alpha }$, with $\alpha >1$. Unlike for the Edge-Reinforced-Random-Walk, which in this case localizes a.s. on 2 sites, here we observe various phase transitions, and in particular localization on arbitrary large sets is possible, provided $\alpha$ is close enough to 1. Our proof relies on stochastic approximation techniques. At the end of the paper, we also prove a general result ensuring that any strongly reinforced VRRW on any bounded degree graph localizes a.s. on a finite subgraph.

19 pp

References in corpus (3)

• Vertex-reinforced random walk on Z eventually gets stuck on five points
• Attracting edge and strongly edge reinforced walks
• Localization of reinforced random walks

Cited by in corpus (4)

• A generalized Polya's urn with graph based interactions
• Strongly vertex-reinforced jump process on a complete graph
• Stuck walks: A conjecture of Erschler, Tóth and Werner
• Dynamic social learning under graph constraints