اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuasi-periodic dynamics and a Neimark-Sacker bifurcation in nonlinear random walks on complex networks
45
0
0.0
(
0
)
تأليف
Per Sebastian Skardal
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the dynamics of nonlinear random walks on complex networks. We investigate the role and effect of directed network topologies on long-term dynamics. While a period-doubling bifurcation to alternating patterns occurs at a critical bias parameter value, we find that some directed structures give rise to a different kind of bifurcation that gives rise to quasi-periodic dynamics. This does not occur for all directed network structure, but only when the network structure is sufficiently directed. We find that the onset of quasi-periodic dynamics is the result of a Neimark-Sacker bifurcation, where a pair of complex-conjugate eigenvalues of the system Jacobian passes through the unit circle, destabilizing the stationary distribution with high-dimensional rotations. We investigate the nature of these bifurcations, study the onset of quasi-periodic dynamics as network structure is tuned to be more directed, and present an analytically tractable case of a four-neighbor ring.
قيم البحث
اقرأ أيضاً
Recently, it has been demonstrated that asymptotic states of open quantum system can undergo qualitative changes resembling pitchfork, saddle-node, and period doubling classical bifurcations. Here, making use of the periodically modulated open quantu
m dimer model, we report and investigate a quantum Neimark-Sacker bifurcation. Its classical counterpart is the birth of a torus (an invariant curve in the Poincar{e} section) due to instability of a limit cycle (fixed point of the Poincar{e} map). The quantum system exhibits a transition from unimodal to bagel shaped stroboscopic distributions, as for Husimi representation, as for observables. The spectral properties of Floquet map experience changes reminiscent of the classical case, a pair of complex conjugated eigenvalues approaching a unit circle. Quantum Monte-Carlo wave function unraveling of the Lindblad master equation yields dynamics of single trajectories on quantum torus and allows for quantifying it by rotation number. The bifurcation is sensitive to the number of quantum particles that can also be regarded as a control parameter.
We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This quantity
is particularly important for random search processes and target localization in network topologies. Based on the global mean first passage time of target nodes we derive an estimate for the cumulative distribution function of the cover time based on first passage time statistics. We show that our result can be applied to various model networks, including ErdH{o}s-Renyi and Barabasi-Albert networks, as well as various real-world networks. Our results reveal an intimate link between first passage and cover time statistics in networks in which structurally induced temporal correlations decay quickly and offer a computationally efficient way for estimating cover times in network related applications.
Complex chemical reaction networks, which underlie many industrial and biological processes, often exhibit non-monotonic changes in chemical species concentrations, typically described using nonlinear models. Such non-monotonic dynamics are in princi
ple possible even in linear models if the matrices defining the models are non-normal, as characterized by a necessarily non-orthogonal set of eigenvectors. However, the extent to which non-normality is responsible for non-monotonic behavior remains an open question. Here, using a master equation to model the reaction dynamics, we derive a general condition for observing non-monotonic dynamics of individual species, establishing that non-normality promotes non-monotonicity but is not a requirement for it. In contrast, we show that non-normality is a requirement for non-monotonic dynamics to be observed in the Renyi entropy. Using hydrogen combustion as an example application, we demonstrate that non-monotonic dynamics under experimental conditions are supported by a linear chain of connected components, in contrast with the dominance of a single giant component observed in typical random reaction networks. The exact linearity of the master equation enables development of rigorous theory and simulations for dynamical networks of unprecedented size (approaching $10^5$ dynamical variables, even for a network of only 20 reactions and involving less than 100 atoms). Our conclusions are expected to hold for other combustion processes, and the general theory we develop is applicable to all chemical reaction networks, including biological ones.
Percolation and synchronization are two phase transitions that have been extensively studied since already long ago. A classic result is that, in the vast majority of cases, these transitions are of the second-order type, i.e. continuous and reversib
le. Recently, however, explosive phenomena have been reported in com- plex networks structure and dynamics, which rather remind first-order (discontinuous and irreversible) transitions. Explosive percolation, which was discovered in 2009, corresponds to an abrupt change in the networks structure, and explosive synchronization (which is concerned, instead, with the abrupt emergence of a collective state in the networks dynamics) was studied as early as the first models of globally coupled phase oscillators were taken into consideration. The two phenomena have stimulated investigations and de- bates, attracting attention in many relevant fields. So far, various substantial contributions and progresses (including experimental verifications) have been made, which have provided insights on what structural and dynamical properties are needed for inducing such abrupt transformations, as well as have greatly enhanced our understanding of phase transitions in networked systems. Our intention is to offer here a monographic review on the main-stream literature, with the twofold aim of summarizing the existing results and pointing out possible directions for future research.
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting nodes. Us
ing a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean-field first-passage time between arbitrary two nodes. All the results are relevant to the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block models, and Barabasi-Albert scale-free networks, and find the advantage of the resetting processes to multiple resetting nodes in global searching on such networks.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
