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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Loop-erased ants need not find shortest paths

Yitzchak Shmalo
Zenodo (CERN European Organization for Nuclear Research)
Stochastic processes and statistical mechanics
preprint

Loop-erased ants need not find shortest paths

Yitzchak Shmalo
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Hebrew University of Jerusalem (IL)
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon