Strongly vertex-reinforced jump process on a complete graph

The aim of our work is to study vertex-reinforced jump processes with super-linear weight function $w(t) = t^\alpha$ , for some $\alpha>1$. On any complete graph $G (V, E)$, we prove that there one vertex $v \in V$ such the total time spent at $v$ almost surely tends infinity while remaining vertices bounded.