Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2206.12801 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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$.