arXiv subjects

Deborah M. Gordon

Publications and source records attributed to Deborah M. Gordon.

4 recordsLinked to original sources

arXiv2025

Mixed-feedback oscillations in the foraging dynamics of arboreal turtle ants

We propose and analyze a model for the dynamics of the flow into and out of a nest for the arboreal turtle ant $\textit{Cephalotes goniodontus}$ during foraging to investigate a possible mechanism for the emergence of oscillations. In our model, there is mixed dynamic feedback between the flow of ants between different behavioral compartments and the amount of pheromone along trails. On one hand, the ants deposit pheromone along the trail, which provides a positive feedback by increasing rates of return to the nest. On the other hand, pheromone evaporation is a source of negative feedback, as it depletes the pheromone and inhibits the return rate. We prove that the model is globally asymptotically stable in the absence of pheromone feedback. Then we show that pheromone feedback can lead to a loss of stability of the equilibrium and onset of sustained oscillations in the flow in and out of the nest via a Hopf bifurcation. This analysis sheds light on a potential key mechanism that enables arboreal turtle ants to effectively optimize their trail networks to minimize traveled path lengths and eliminate graph cycles.

q-bio.PE↗

arXiv2023

Distributed Algorithms from Arboreal Ants for the Shortest Path Problem

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.

cs.DS↗

arXiv2017

Spatial organization and interactions of harvester ants during foraging activity

Local interactions, when individuals meet, can regulate collective behavior. In a system without any central control, the rate of interaction may depend simply on how the individuals move around. But interactions could in turn influence movement; individuals might seek out interactions, or their movement in response to interaction could influence further interaction rates. We develop a general framework to address these questions, using collision theory to establish a baseline expected rate of interaction based on proximity. We test the models using data from harvester ant colonies. A colony uses feedback from interactions inside the nest to regulate foraging activity. Potential foragers leave the nest in response to interactions with returning foragers with food. The time series of interactions and local density of ants show how density hotspots lead to interactions that are clustered in time. A correlated random walk null model describes the mixing of potential and returning foragers. A model from collision theory relates walking speed and spatial proximity with the probability of interaction. The results demonstrate that although ants do not mix homogeneously, trends in interaction patterns can be explained simply by the walking speed and local density of surrounding ants.

physics.bio-ph↗

arXiv2016

Idle Ants Have a Role

Using elementary distributed computing techniques we suggest an explanation for two unexplained phenomena in regards to ant colonies, (a) a substantial amount of ants in an ant colony are idle, and (b) the observed low survivability of new ant colonies in nature. Ant colonies employ task allocation, in which ants progress from one task to the other, to meet changing demands introduced by the environment. Extending the biological task allocation model given in [Pacala, Gordon and Godfray 1996] we present a distributed algorithm which mimics the mechanism ants use to solve task allocation efficiently in nature. Analyzing the time complexity of the algorithm reveals an exponential gap on the time it takes an ant colony to satisfy a certain work demand with and without idle ants. We provide an $O(\ln n)$ upper bound when a constant fraction of the colony are idle ants, and a contrasting lower bound of $Ω(n)$ when there are no idle ants, where $n$ is the total number of ants in the colony.

cs.DC↗