Strongly vertex-reinforced-random-walk on a complete graph
From MaRDI portal
Publication:2866841
Abstract: We study Vertex-Reinforced-Random-Walk on the complete graph with weights of the form , with . 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 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.
Recommendations
- Localization on 4 sites for vertex-reinforced random walks on \(\mathbb{Z}\)
- Localization of a vertex reinforced random walk on \(\mathbb Z\) with sub-linear weight
- Phase transition in vertex-reinforced random walks on \({\mathbb{Z}}\) with nonlinear reinforcement
- VRRW on complete-like graphs: almost sure behavior
- Vertex-reinforced random walk on arbitrary graphs
Cited in
(15)- Vertex reinforced non-backtracking random walks: an example of path formation
- The directed edge reinforced random walk: the Ant Mill phenomenon
- Lyapunov function for interacting reinforced stochastic processes via Hopfield's energy function
- A 0-1 law for vertex-reinforced random walks on \(\mathbb{Z}\) with weight of order \(k^\alpha,\;\alpha\in[0,1/2)\)
- Proof of the WARM whisker conjecture for neuronal connections
- Localization on 5 sites for vertex reinforced random walks: towards a characterization
- Stuck walks: a conjecture of Erschler, Tóth and Werner
- VRRW on complete-like graphs: almost sure behavior
- Dynamics of vertex-reinforced random walks
- Phase transition in vertex-reinforced random walks on \({\mathbb{Z}}\) with nonlinear reinforcement
- Localization on 4 sites for vertex-reinforced random walks on \(\mathbb{Z}\)
- Two repelling random walks on \(\mathbb{Z}\)
- Synchronization and functional central limit theorems for interacting reinforced random walks
- Strongly vertex-reinforced jump process on a complete graph
- Vertex-reinforced random walk on arbitrary graphs
This page was built for publication: Strongly vertex-reinforced-random-walk on a complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866841)