Ask a Question

Prefer a chat interface with context about you and your work?

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

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

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 …