اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGeneral three-state model with biased population replacement: Analytical solution and application to language dynamics
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Empirical evidence shows that the rate of irregular usage of English verbs exhibits discontinuity as a function of their frequency: the most frequent verbs tend to be totally irregular. We aim to qualitatively understand the origin of this feature by studying simple agent--based models of language dynamics, where each agent adopts an inflectional state for a verb and may change it upon interaction with other agents. At the same time, agents are replaced at some rate by new agents adopting the regular form. In models with only two inflectional states (regular and irregular), we observe that either all verbs regularize irrespective of their frequency, or a continuous transition occurs between a low frequency state where the lemma becomes fully regular, and a high frequency one where both forms coexist. Introducing a third (mixed) state, wherein agents may use either form, we find that a third, qualitatively different behavior may emerge, namely, a discontinuous transition in frequency. We introduce and solve analytically a very general class of three--state models that allows us to fully understand these behaviors in a unified framework. Realistic sets of interaction rules, including the well-known Naming Game (NG) model, result in a discontinuous transition, in agreement with recent empirical findings. We also point out that the distinction between speaker and hearer in the interaction has no effect on the collective behavior. The results for the general three--state model, although discussed in terms of language dynamics, are widely applicable.
قيم البحث
اقرأ أيضاً
The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact solution of average path length, $bar{d}_t$, for Apollonian networks. In
contrast to the well-known numerical result $bar{d}_t propto (ln N_t)^{3/4}$ [Phys. Rev. Lett. textbf{94}, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmically as $bar{d}_t propto ln N_t$ in the infinite limit of network size $N_t$. The extensive numerical calculations completely agree with our closed-form solution.
Many sociological networks, as well as biological and technological ones, can be represented in terms of complex networks with a heterogeneous connectivity pattern. Dynamical processes taking place on top of them can be very much influenced by this t
opological fact. In this paper we consider a paradigmatic model of non-equilibrium dynamics, namely the forest fire model, whose relevance lies in its capacity to represent several epidemic processes in a general parametrization. We study the behavior of this model in complex networks by developing the corresponding heterogeneous mean-field theory and solving it in its steady state. We provide exact and approximate expressions for homogeneous networks and several instances of heterogeneous networks. A comparison of our analytical results with extensive numerical simulations allows to draw the region of the parameter space in which heterogeneous mean-field theory provides an accurate description of the dynamics, and enlights the limits of validity of the mean-field theory in situations where dynamical correlations become important.
We find an exact general solution to the three-dimensional (3D) Ising model via an exact self-consistency equation for nearest-neighbors correlations. It is derived by means of an exact solution to the recurrence equations for partial contractions of
creation and annihilation operators for constrained spin bosons in a Holstein-Primakoff representation. In particular, we calculate analytically the total irreducible self-energy, the order parameter, the correlation functions, and the joined occupation probabilities of spin bosons. The developed regular microscopic quantum-field-theory method has a potential for a full solution of a long-standing and still open problem of 3D critical phenomena.
It has been recently discovered that the measles virus can wipe out the adaptive immune system, destroying B lymphocytes and reducing the diversity of non-specific B cells of the infected host. In particular, this implies that previously acquired imm
unization from vaccination or direct exposition to other pathogens could be erased in a phenomenon named immune amnesia, whose effects can become particularly worrisome given the actual rise of anti-vaccination movements. Here we present the first attempt to incorporate immune amnesia into standard models of epidemic spreading. In particular, we analyze diverse variants of a model that describes the spreading of two concurrent pathogens causing measles and another generic disease: the SIR-IA model. Analytical and computational studies confirm that immune amnesia can indeed have important consequences for epidemic spreading, significantly altering the vaccination coverage required to reach herd-immunity for concurring infectious diseases. More specifically, we uncover the existence of novel propagating and endemic phases which are induced by immune amnesia, that appear both in fully-connected and more structured networks, such as random networks and power-law degree-distributed ones. In particular, the transitions from a quiescent state into these novel phases can become rather abrupt in some cases that we specifically analyze. Furthermore, we discuss the meaning and consequences of our results and their relation with, e.g., immunization strategies, together with the possibility that explosive types of transitions may emerge, making immune-amnesia effects particularly dramatic. This work opens the door to further developments and analyses of immune amnesia effects, contributing, more generally, to the theory of interacting epidemics on complex networks.
In the context of a pandemic like COVID-19, and until most people are vaccinated, proactive testing and interventions have been proved to be the only means to contain the disease spread. Recent academic work has offered significant evidence in this r
egard, but a critical question is still open: Can we accurately identify all new infections that happen every day, without this being forbiddingly expensive, i.e., using only a fraction of the tests needed to test everyone everyday (complete testing)? Group testing offers a powerful toolset for minimizing the number of tests, but it does not account for the time dynamics behind the infections. Moreover, it typically assumes that people are infected independently, while infections are governed by community spread. Epidemiology, on the other hand, does explore time dynamics and community correlations through the well-established continuous-time SIR stochastic network model, but the standard model does not incorporate discrete-time testing and interventions. In this paper, we introduce a discrete-time SIR stochastic block model that also allows for group testing and interventions on a daily basis. Our model can be regarded as a discrete version of the continuous-time SIR stochastic network model over a specific type of weighted graph that captures the underlying community structure. We analyze that model w.r.t. the minimum number of group tests needed everyday to identify all infections with vanishing error probability. We find that one can leverage the knowledge of the community and the model to inform nonadaptive group testing algorithms that are order-optimal, and therefore achieve the same performance as complete testing using a much smaller number of tests.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
