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...
Главные авторы: | Benaim, M, Tarres, P |
---|---|
Формат: | Journal article |
Опубликовано: |
2011
|
Схожие документы
-
Vertex-reinforced random walk on Z eventually gets stuck on five points
по: Tarres, P
Опубликовано: (2004) -
Attracting edge and strongly edge reinforced walks
по: Limic, V, и др.
Опубликовано: (2007) -
On the last new vertex visited by a random walk in a directed graph
по: Calum Buchanan, и др.
Опубликовано: (2023-03-01) -
Improving Network Representation Learning via Dynamic Random Walk, Self-Attention and Vertex Attributes-Driven Laplacian Space Optimization
по: Shengxiang Hu, и др.
Опубликовано: (2022-08-01) -
On the Vertex-Connectivity of an Uncertain Random Graph
по: Hao Li, и др.
Опубликовано: (2020-01-01)