Strongly vertex-reinforced jump process on graphs with bounded degree
Probability
2024-10-29 v2
Abstract
We study asymptotic behaviours of a non-linear vertex-reinforced jump process defined on an arbitrary infinite graph with bounded degree. We prove that if the reinforcement function is reciprocally integrable and non-decreasing, then the process visits only a finite number of vertices. In the case where is approximately equal to a super-linear polynomial, we show that the process eventually gets stuck on a star-shaped subgraph and there is exactly one vertex with unbounded local time.
Keywords
Cite
@article{arxiv.2401.04366,
title = {Strongly vertex-reinforced jump process on graphs with bounded degree},
author = {Andrea Collevecchio and Tuan-Minh Nguyen},
journal= {arXiv preprint arXiv:2401.04366},
year = {2024}
}
Comments
43 pages