اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSynchronization of Conservative Parallel Discrete Event Simulations on a Small-World Network
203
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We examine the question of the influence of sparse long-range communications on the synchronization in parallel discrete event simulations (PDES). We build a model of the evolution of local virtual times (LVT) in a conservative algorithm including several choices of local links. All network realizations belong to the small-world network class. We find that synchronization depends on the average shortest path of the network. The time profile dynamics are similar to the surface profile growth, which helps to analyze synchronization effects using a statistical physics approach. Without long-range links of the nodes, the model belongs to the universality class of the Kardar--Parisi--Zhang equation for surface growth. We find that the critical exponents depend logarithmically on the fraction of long-range links. We present the results of simulations and discuss our observations.
قيم البحث
اقرأ أيضاً
A lattice of three-state stochastic phase-coupled oscillators introduced by Wood it et al. exhibits a phase transition at a critical value of the coupling parameter $a$, leading to stable global oscillations (GO). On a complete graph, upon further in
crease in $a$, the model exhibits an infinite-period (IP) phase transition, at which collective oscillations cease and discrete rotational ($C_3$) symmetry is broken. In the case of large negative values of the coupling, Escaff et al. discovered the stability of travelling-wave states with no global synchronization but with local order. Here, we verify the IP phase in systems with long-range coupling but of lower connectivity than a complete graph and show that even for large positive coupling, the system sometimes fails to reach global order. The ensuing travelling-wave state appears to be a metastable configuration whose birth and decay (into the previously described phases) are associated with the initial conditions and fluctuations.
We study seasonal epidemic spreading in a susceptible-infected-removed-susceptible (SIRS) model on smallworld graphs. We derive a mean-field description that accurately captures the salient features of the model, most notably a phase transition betwe
en annual and biennial outbreaks. A numerical scaling analysis exhibits a diverging autocorrelation time in the thermodynamic limit, which confirms the presence of a classical discrete time crystalline phase. We derive the phase diagram of the model both from mean-field theory and from numerics. Our work offers new perspectives by demonstrating that small-worldness and non-Markovianity can stabilize a classical discrete time crystal, and by linking recent efforts to understand such dynamical phases of matter to the century-old problem of biennial epidemics.
We study the collective behavior of an Ising system on a small-world network with the interaction $J(r) propto r^{-alpha}$, where $r$ represents the Euclidean distance between two nodes. In the case of $alpha = 0$ corresponding to the uniform interac
tion, the system is known to possess a phase transition of the mean-field nature, while the system with the short-range interaction $(alphatoinfty)$ does not exhibit long-range order at any finite temperature. Monte Carlo simulations are performed at various values of $alpha$, and the critical value $alpha_c$ beyond which the long-range order does not emerge is estimated to be zero. Thus concluded is the absence of a phase transition in the system with the algebraically decaying interaction $r^{-alpha}$ for any nonzero positive value of $alpha$.
In this paper we analyze the effect of a non-trivial topology on the dynamics of the so-called Naming Game, a recently introduced model which addresses the issue of how shared conventions emerge spontaneously in a population of agents. We consider in
particular the small-world topology and study the convergence towards the global agreement as a function of the population size $N$ as well as of the parameter $p$ which sets the rate of rewiring leading to the small-world network. As long as $p gg 1/N$ there exists a crossover time scaling as $N/p^2$ which separates an early one-dimensional-like dynamics from a late stage mean-field-like behavior. At the beginning of the process, the local quasi one-dimensional topology induces a coarsening dynamics which allows for a minimization of the cognitive effort (memory) required to the agents. In the late stages, on the other hand, the mean-field like topology leads to a speed up of the convergence process with respect to the one-dimensional case.
We investigate the multifractals of the normalized first passage time on one-dimensional small-world network with both reflecting and absorbing barriers. The multifractals is estimated from the distribution of the normalized first passage time charac
trized by the random walk on the small-world network with three fractions of edges rewired randomly. Particularly, our estimate is the fractal dimension D_0 = 0.917, 0.926, 0.930 for lattice points L = 80 and a randomly rewired fraction p = 0.2. The numerical result is found to disappear multifractal properties in the regime p> p_c, where p_c is the critical rewired fraction.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
