Convergence of the forward-loop-erased ants process at distance two
In the forward-loop-erased ants process, the nth ant walks from a nest N to a food source F with transition probabilities proportional to the current edge weights, and every edge of the chronological loop erasure of its path gains weight one. Armfield and Mailler showed that when N and F are at distance two the ants find the shortest paths, and left open whether W(n)/n converges. We show that it converges almost surely and that every path of length two keeps a positive share in the limit. The key fact is that for a common neighbour i of N and F the relative drift of W_{N,i}(n) W_{i,F}(n) is the inverse effective conductance between N and F, the same for all i, up to a summable error; hence ratios of these products converge on every finite graph.
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24277620
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- preprint