اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMountain trail formation and the active walker model
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 falling. Further augmentation of the model stops walkers from changing direction very rapidly as that would likely lead to a fall. The extended model predicts paths with qualitatively similar forms to the observed trails, but only if the terms suppressing sudden direction changes are included. The need to include terms into the model that stop rapid direction change when simulating mountain trails indicates that a similar rule should also be included in the standard active walker model.
قيم البحث
اقرأ أيضاً
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, wher
e 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 investigate statistical properties of trails formed by a random process incorporating aggregation, fragmentation, and diffusion. In this stochastic process, which takes place in one spatial dimension, two neighboring trails may combine to form a l
arger one and also, one trail may split into two. In addition, trails move diffusively. The model is defined by two parameters which quantify the fragmentation rate and the fragment size. In the long-time limit, the system reaches a steady state, and our focus is the limiting distribution of trail weights. We find that the density of trail weight has power-law tail $P(w) sim w^{-gamma}$ for small weight $w$. We obtain the exponent $gamma$ analytically, and find that it varies continuously with the two model parameters. The exponent $gamma$ can be positive or negative, so that in one range of parameters small-weight tails are abundant, and in the complementary range, they are rare.
Modularity structures are common in various social and biological networks. However, its dynamical origin remains an open question. In this work, we set up a dynamical model describing the evolution of a social network. Based on the observations of r
eal social networks, we introduced a link-creating/deleting strategy according to the local dynamics in the model. Thus the coevolution of dynamics and topology naturally determines the network properties. It is found that for a small coupling strength, the networked system cannot reach any synchronization and the network topology is homogeneous. Interestingly, when the coupling strength is large enough, the networked system spontaneously forms communities with different dynamical states. Meanwhile, the network topology becomes heterogeneous with modular structures. It is further shown that in a certain parameter regime, both the degree and the community size in the formed network follow a power-law distribution, and the networks are found to be assortative. These results are consistent with the characteristics of many empirical networks, and are helpful to understand the mechanism of formation of modularity in complex networks.
The Persistent Turning Walker Model (PTWM) was introduced by Gautrais et al in Mathematical Biology for the modelling of fish motion. It involves a nonlinear pathwise functional of a non-elliptic hypo-elliptic diffusion. This diffusion solves a kinet
ic Fokker-Planck equation based on an Ornstein-Uhlenbeck Gaussian process. The long time diffusive behavior of this model was recently studied by Degond & Motsch using partial differential equations techniques. This model is however intrinsically probabilistic. In the present paper, we show how the long time diffusive behavior of this model can be essentially recovered and extended by using appropriate tools from stochastic analysis. The approach can be adapted to many other kinetic probabilistic models.
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
gent-based network model to study interacting hosts and guests and identify the conditions under which cooperative/integrated or uncooperative/segregated societies arise. Players are assumed to seek socioeconomic prosperity through game theoretic rules that shift network links, and cultural acceptance through opinion dynamics. We find that the main predictor of integration under given initial conditions is the timescale associated with cultural adjustment relative to social link remodeling, for both guests and hosts. Fast cultural adjustment results in cooperation and the establishment of host-guest connections that are sustained over long times. Conversely, fast social link remodeling leads to the irreversible formation of isolated enclaves, as migrants and natives optimize their socioeconomic gains through in-group connections. We discuss how migrant population sizes and increasing socioeconomic rewards for host-guest interactions, through governmental incentives or by admitting migrants with highly desirable skills, may affect the overall immigrant experience.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
