ﻻ يوجد ملخص باللغة العربية
We introduce a model for ant trail formation, building upon previous work on biologically feasible local algorithms that plausibly describe how ants maintain trail networks. The model is a variant of a reinforced random walk on a directed graph, where ants lay pheromone on edges as they traverse them and the next edge to traverse is chosen based on the pheromone level; this pheromone decays with time. There is a bidirectional flow of ants: the forward flow proceeds along forward edges from source (e.g. the nest) to sink (e.g. a food source), and the backward flow in the opposite direction. Some fraction of ants are lost as they pass through each node (modeling the loss of ants due to exploration). We initiate a theoretical study of this model. We first consider the linear decision rule, where the flow divides itself among the next set of edges in proportion to their pheromone level. Here, we show that the process converges to the path with minimum leakage when the forward and backward flows do not change over time. When the forward and backward flows increase over time (caused by positive reinforcement from the discovery of a food source, for example), we show that the process converges to the shortest path. These results are for graphs consisting of two parallel paths (a case that has been investigated before in experiments). Through simulations, we show that these results hold for more general graphs drawn from various random graph models. Further, we consider a general family of decision rules, and show that there is no advantage of using a non-linear rule from this family, if the goal is to find the shortest or the minimum leakage path. We also show that bidirectional flow is necessary for convergence to such paths. Our results provide a plausible explanation for field observations, and open up new avenues for further theoretical and experimental investigation.
We extend the active walker model to address the formation of paths on gradients, which have been observed to have a zigzag form. Our extension includes a new rule which prohibits direct descent or ascent on steep inclines, simulating aversion to fal
Self-organized bistability (SOB) is the counterpart of self-organized criticality (SOC), for systems tuning themselves to the edge of bistability of a discontinuous phase transition, rather than to the critical point of a continuous one. The equation
Swarm intelligence is widely recognized as a powerful paradigm of self-organized optimization, with numerous examples of successful applications in distributed artificial intelligence. However, the role of physical interactions in the organization of
Successfully integrating newcomers into native communities has become a key issue for policy makers, as the growing number of migrants has brought cultural diversity, new skills, and at times, societal tensions to receiving countries. We develop an a
Uncertainties from experiments and models render multi-modal difficulties in model calibrations. Bayesian inference and textsc{mcmc} algorithm have been applied to obtain posterior distributions of model parameters upon uncertainty. However, multi-mo