arXiv · 1810.06905
Strongly vertex-reinforced jump process on a complete graph
Abstract
The aim of our work is to study vertex-reinforced jump processes with super-linear weight function $w(t) = t^α$ , for some $α>1$. On any complete graph $G = (V, E)$, we prove that there is one vertex $v \in V$ such that the total time spent at $v$ almost surely tends to infinity while the total time spent at the remaining vertices is bounded.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Olivier Raimond, Tuan-Minh Nguyen. 2021-03-18. Strongly vertex-reinforced jump process on a complete graph. https://doi.org/10.1214/20-aihp1115
Cite the original work for its findings. Save a collection to share your selection of sources.