DYNAMICS OF VERTEX-REINFORCED RANDOM WALKS
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 (G, ~) and symmetric reinforcement matrices a = (a i,j ) i,j∈G, the vertex-reinforced random walk (VRRW) eventually localizes with positive probabil...
Main Authors: | Benaim, M, Tarres, P |
---|---|
Format: | Journal article |
Published: |
2011
|
Similar Items
-
Vertex-reinforced random walk on Z eventually gets stuck on five points
by: Tarres, P
Published: (2004) -
Attracting edge and strongly edge reinforced walks
by: Limic, V, et al.
Published: (2007) -
On the last new vertex visited by a random walk in a directed graph
by: Calum Buchanan, et al.
Published: (2023-03-01) -
Improving Network Representation Learning via Dynamic Random Walk, Self-Attention and Vertex Attributes-Driven Laplacian Space Optimization
by: Shengxiang Hu, et al.
Published: (2022-08-01) -
On the Vertex-Connectivity of an Uncertain Random Graph
by: Hao Li, et al.
Published: (2020-01-01)