Related papers: The two-nest ants process on triangle-series-paral…
We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the…
In this article, we introduce a random (directed) graph model for the simultaneous forwards and backwards description of a rather broad class of Cannings models with a seed bank mechanism. This provides a simple tool to establish a sampling…
We are interested in modeling some two-level population dynamics, resulting from the interplay of ecological interactions and phenotypic variation of individuals (or hosts) and the evolution of cells (or parasites) of two types living in…
We study a stochastic individual-based model of interacting plant and pollinator species through a bipartite graph: each species is a node of the graph, an edge representing interactions between a pair of species. The dynamics of the system…
Motivated by the study of social insects, we introduce a stochastic model based on interacting particle systems in order to understand the effect of communication on the division of labor. Members of the colony are located on the vertex set…
The foraging problem asks how a collective of particles with limited computational, communication and movement capabilities can autonomously compress around a food source and disperse when the food is depleted or shifted, which may occur at…
Many insects like ants communicate chemically via chemotaxis. This allows them to build large trail systems which in many respects are similar to human-build highway networks. Using a recently proposed stochastic cellular automaton model we…
Understanding predator-prey relationships among insects is a challenging task in the domain of insect-colony research. This is due to several factors involved, such as determining whether a particular behavior is the result of a…
Data in the form of graphs, or networks, arise naturally in a number of contexts; examples include social networks and biological networks. We are often faced with the availability of multiple graphs on a single set of nodes. In this…
We consider discrete dynamical systems of "ant-like" agents engaged in a sequence of pursuits on a graph environment. The agents emerge one by one at equal time intervals from a source vertex $s$ and pursue each other by greedily attempting…
Motivated by recent experimental work of Burd et al., we propose a model of bi-directional ant-traffic on pre-existing ant-trails. It captures in a simple way some of the generic collective features of movements of real ants on a trail.…
Ants are social insects. When the existing nest of an ant colony becomes uninhabitable, the hunt for a new suitable location for migration of the colony begins. Normally, multiple sites may be available as the potential new nest site.…
Hand-crafting effective and efficient structures for recurrent neural networks (RNNs) is a difficult, expensive, and time-consuming process. To address this challenge, we propose a novel neuro-evolution algorithm based on ant colony…
Ant colony optimization (ACO) leverages the parameter $\alpha$ to modulate the decision function's sensitivity to pheromone levels, balancing the exploration of diverse solutions with the exploitation of promising areas. Identifying the…
We consider the sequential sampling of species, where observed samples are classified into the species they belong to. We are particularly interested in studying some quantities describing the sampling process when there is a new species…
Over the years, population protocols with the goal of reaching consensus have been studied in great depth. However, many systems in the real-world do not result in all agents eventually reaching consensus, but rather in the opposite: they…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
Nutritional regulation by ants emerges from a distributed process: food is collected by a small fraction of workers, stored within the crops of individuals, and spreads via local ant-to-ant interactions. The precise individual level…
We define here a \textit{directed edge reinforced random walk} on a connected locally finite graph. As the name suggests, this walk keeps track of its past, and gives a bias towards directed edges previously crossed proportional to the…
Ant Colony Optimization (ACO) is a swarm intelligence methodology utilized for solving optimization problems through information transmission mediated by pheromones. As ants sequentially secrete pheromones that subsequently evaporate, the…