Dynamics of vertex-reinforced random walks
Michel Bena\"im, Pierre Tarr\`es

TL;DR
This paper studies the long-term behavior of vertex-reinforced random walks on graphs, showing they tend to localize on specific subgraphs related to stable equilibria of associated replicator dynamics.
Contribution
It generalizes previous results by linking VRRW localization to stable equilibria of replicator dynamics on graphs, applicable to population genetics and game theory.
Findings
VRRW localizes on complete d-partite subgraphs with positive probability.
Stable equilibria support the walk's localization and convergence of occupation density.
The results connect VRRW behavior with replicator dynamics stability analysis.
Abstract
We generalize a result from Volkov [Ann. Probab. 29 (2001) 66--91] and prove that, on a large class of locally finite connected graphs of bounded degree and symmetric reinforcement matrices , the vertex-reinforced random walk (VRRW) eventually localizes with positive probability on subsets which consist of a complete -partite subgraph with possible loops plus its outer boundary. We first show that, in general, any stable equilibrium of a linear symmetric replicator dynamics with positive payoffs on a graph satisfies the property that its support is a complete -partite subgraph of with possible loops, for some . This result is used here for the study of VRRWs, but also applies to other contexts such as evolutionary models in population genetics and game theory. Next we generalize the result of Pemantle [Probab. Theory Related Fields…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
