Abstract
We introduce random interlacements for transient vertex-reinforced jump processes on a general graph G. Using increasing finite subgraphs G(n) of G with wired boundary conditions, we show convergence of the vertex-reinforced jump process on Gn observed in a finite window to the random interlacement observed in the same window.
| Item Type: | Journal article |
|---|---|
| Faculties: | Mathematics, Computer Science and Statistics > Mathematics |
| Subjects: | 500 Science > 510 Mathematics |
| ISSN: | 0246-0203 |
| Language: | English |
| Item ID: | 100534 |
| Date Deposited: | 05. Jun 2023 15:35 |
| Last Modified: | 13. Aug 2024 12:46 |
