2020/11/30 by Shivam Garg, Garg, Shivam, Kirankumar Shiragur +5
Biochemistry, Genetics and Molecular Biology · Environmental Science · #Adaptation and Self-Organizing Systems (nlin.AO) #Data Structures and Algorithms (cs.DS) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Physical sciences #Insect and Arachnid Ecology and Behavior #Quantitative Methods (q-bio.QM) #Wildlife-Road Interactions and Conservation
paper · doi:10.48550/arxiv.2011.14722
openalex publication_date 2020/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Colonies of the arboreal turtle ant create networks of trails that link nests and food sources on the graph formed by branches and vines in the canopy of the tropical forest. Ants put down a volatile pheromone on edges as they traverse them. At each vertex, the next edge to traverse is chosen using a decision rule based on the current pheromone level. There is a bidirectional flow of ants around the network. In a field study, Chandrasekhar et al. (2021) observed that the trail networks approximately minimize the number of vertices, thus solving a variant of the popular shortest path problem without any central control and with minimal computational resources. We propose a biologically plausible model, based on a variant of the reinforced random walk on a graph, which explains this observation and suggests surprising algorithms for the shortest path problem and its variants. Through simulations and analysis, we show that when the rate of flow of ants does not change, the dynamics converges to the path with the minimum number of vertices, as observed in the field. The dynamics converges to the shortest path when the rate of flow increases with time, so the colony can solve the shortest path problem merely by increasing the flow rate. We also show that to guarantee convergence to the shortest path, bidirectional flow and a decision rule dividing the flow in proportion to the pheromone level are necessary, but convergence to approximately short paths is possible with other decision rules.