Loop-erased ants need not find shortest paths
In the ant process on a finite graph, each ant performs a random walk from a nest to a food source with transition probabilities proportional to the current edge weights, and every edge on the loop erasure of its trajectory gains weight one. Kious, Mailler and Schapira conjectured that the normalised weight of every edge outside the shortest paths tends to zero when the trajectory is reversed before the loops are erased. Armfield and Mailler conjectured the same for the erasure of the forward trajectory and proved it when the nest and the food are at distance two. By the Aldous–Broder and Wilson algorithms the two erasure rules give the reinforced path the same law, so the two processes coincide in law. We then give a graph with six vertices on which, with positive probability, an edge on no shortest path keeps a limiting normalised weight in [2499/20000,1/8]. Adding a path at the nest gives counterexamples at every distance at least three.
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-19
- DOI
- https://doi.org/10.5281/zenodo.24368659
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- preprint