Related papers: Ant foraging and minimal paths in simple graphs
We propose a minimal model of predator-swarm interactions which captures many of the essential dynamics observed in nature. Different outcomes are observed depending on the predator strength. For a "weak" predator, the swarm is able to…
Animal movement exhibits complex behavior which can be influenced by unobserved environmental conditions. We propose a model which allows for a spatially-varying movement rate and spatially-varying drift through a semiparametric potential…
We explore the relation between memcomputing, namely computing with and in memory, and swarm intelligence algorithms. In particular, we show that one can design memristive networks to solve short-path optimization problems that can also be…
A modified version of Langton's ant is considered. The modified automaton is allowed to go straight $N$-th step instead of turning. The cell state, however, is changed as usually. Depending on the value of $N$ the automaton exhibits…
Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…
Motion and interaction of social insects (such as ants) have been studied by many researchers to understand the clustering mechanism. Most studies in the field of ant behavior have only focused on indoor environments, while outdoor…
Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting…
Thanks to recent technological advances, it is now possible to track with an unprecedented precision and for long periods of time the movement patterns of many living organisms in their habitat. The increasing amount of data available on…
In this paper, we propose a new model of chemotaxis motivated by ant trail pattern formation, formulated as a coupled parabolic-parabolic local PDE system, for the population density and the chemical field. The main novelty lies in the…
We discuss various features of the trajectories of spider monkeys looking for food in a tropical forest, as observed recently in an extensive {\it in situ} study. Some of the features observed can be interpreted as the result of social…
In this paper it is introduced a biobjective ant algorithm for constructing low cost routing networks. The new algorithm is called the Distributed Pharaoh System (DPS). DPS is based on AntNet algorithm. The algorithm is using Pharaoh Ant…
We propose two modeling approaches to describe the dynamics of ant battles, starting from laboratory experiments on the behavior of two ant species, the invasive Lasius neglectus and the authocthonus Lasius paralienus. This work is mainly…
Animal locomotion is often subject to constraints arising from anatomical/physiological asymmetries. We use the nematode C.~elegans as a minimal model system to ask whether such constraints might shape locomotion patterns optimized during…
A spacially extended model of the collective behavior of a large number of locally acting organisms is proposed in which organisms move probabilistically between local cells in space, but with weights dependent on local morphogenetic…
We develop a path-based approach to continuous-time random walks on networks with arbitrarily weighted edges. We describe an efficient numerical algorithm for calculating statistical properties of the stochastic path ensemble. After…
Active walker models have recently proved their great value for describing the formation of clusters, periodic patterns, and spiral waves as well as the development of rivers, dielectric breakdown patterns, and many other structures. It is…
Ant Colony Optimization (ACO) is a very popular metaheuristic for solving computationally hard combinatorial optimization problems. Runtime analysis of ACO with respect to various pseudo-boolean functions and different graph based…
Complex systems of interacting components often can be modeled by a simple graph $\mathcal{G}$ that consists of a set of $n$ nodes and a set of $m$ edges. Such a graph can be represented by an adjacency matrix $A\in\R^{n\times n}$, whose…
We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and rigorously accounts for loops in a network. We calculate the…