اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDiverse Stochasticity Leads a Colony of Ants to Optimal Foraging
122
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A mathematical model of garden ants (Laius japonicus) is introduced herein to investigate the relationship between the distribution of the degree of stochasticity in following pheromone trails and the group foraging efficiency. Numerical simulations of the model indicate that depending on the systematic change of the feeding environment, the optimal distribution of stochasticity shifts from a mixture of almost deterministic and mildly stochastic ants to a contrasted mixture of almost deterministic ants and highly stochastic ants. In addition, the interaction between the stochasticity and the pheromone path regulates the dynamics of the foraging efficiency optimization. Stochasticity could strengthen the collective efficiency when stochasticity to the sensitivity of pheromone for ants is introduced in the model.
قيم البحث
اقرأ أيضاً
How does the visual design of digital platforms impact user behavior and the resulting environment? A body of work suggests that introducing social signals to content can increase both the inequality and unpredictability of its success, but has only
been shown in the context of music listening. To further examine the effect of social influence on media popularity, we extend this research to the context of algorithmically-generated images by re-adapting Salganik et als Music Lab experiment. On a digital platform where participants discover and curate AI-generated hybrid animals, we randomly assign both the knowledge of other participants behavior and the visual presentation of the information. We successfully replicate the Music Labs findings in the context of images, whereby social influence leads to an unpredictable winner-take-all market. However, we also find that social influence can lead to the emergence of local cultural trends that diverge from the status quo and are ultimately more diverse. We discuss the implications of these results for platform designers and animal conservation efforts.
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. Distinct sites
may be chosen by different scout ants based on their own assessments. Since the individual assessment is error prone, many ants may choose inferior site(s). But, the collective decision that emerges from the sequential and decentralized decision making process is often far better. We develop a model for this multi-stage decision making process. A stochastic drift-diffusion model (DDM) captures the sequential information accumulation by individual scout ants for arriving at their respective individual choices. The subsequent tandem runs of the scouts, whereby they recruit their active nestmates, is modelled in terms of suitable adaptations of the totally asymmetric simple exclusion processes (TASEP). By a systematic analysis of the model we explore the conditions that determine the speed of the emergence of the collective decision and the quality of that decision. More specifically, we demonstrate that collective decision of the colony is much less error-prone that the individual decisions of the scout ants. We also compare our theoretical predictions with experimental data.
This paper analyzes the car following behavioral stochasticity based on two sets of field experimental trajectory data by measuring the wave travel time series of vehicle n. The analysis shows that (i) No matter the speed of leading vehicle oscillate
s significantly or slightly, wave travel time might change significantly; (ii) A followers wave travel time can vary from run to run even the leader travels at the same stable speed; (iii) Sometimes, even if the leader speed fluctuates significantly, the follower can keep a nearly constant value of wave travel time. The Augmented Dickey-Fuller test indicates that the time series the changing rate of wave travel time follows a mean reversion process, no matter the oscillations fully developed or not. Based on the finding, a simple stochastic Newell model is proposed. The concave growth pattern of traffic oscillations has been derived analytically. Furthermore, simulation results demonstrate that the new model well captures both macroscopic characteristic of traffic flow evolution and microscopic characteristic of car following.
We develop a theoretical approach to ``spontaneous stochasticity in classical dynamical systems that are nearly singular and weakly perturbed by noise. This phenomenon is associated to a breakdown in uniqueness of solutions for fixed initial data and
underlies many fundamental effects of turbulence (unpredictability, anomalous dissipation, enhanced mixing). Based upon analogy with statistical-mechanical critical points at zero temperature, we elaborate a renormalization group (RG) theory that determines the universal statistics obtained for sufficiently long times after the precise initial data are ``forgotten. We apply our RG method to solve exactly the ``minimal model of spontaneous stochasticity given by a 1D singular ODE. Generalizing prior results for the infinite-Reynolds limit of our model, we obtain the RG fixed points that characterize the spontaneous statistics in the near-singular, weak-noise limit, determine the exact domain of attraction of each fixed point, and derive the universal approach to the fixed points as a singular large-deviations scaling, distinct from that obtained by the standard saddle-point approximation to stochastic path-integrals in the zero-noise limit. We present also numerical simulation results that verify our analytical predictions, propose possible experimental realizations of the ``minimal model, and discuss more generally current empirical evidence for ubiquitous spontaneous stochasticity in Nature. Our RG method can be applied to more complex, realistic systems and some future applications are briefly outlined.
We present a foraging algorithm, GoldenFA, in which search direction is chosen based on the Golden Ratio. We show both theoretically and empirically that GoldenFA is more efficient for a single searcher than a comparable algorithm where search direct
ion is chosen uniformly at random. Moreover, we give a variant of our algorithm that parallelizes linearly with the number of searchers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
