























A $δ$ once-reinforced random walk ($δ$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges that have not been traversed and $δ$ otherwise. In this paper, we prove a large deviation principle for empirical measures of $δ$-ORRWs on finite connected graphs using a modified weak convergence approach. The rate function of the large deviation principle exhibits a phase transition at the $δ=1$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。