اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNetwork analysis of chaotic dynamics in fixed-precision digital domain
49
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
When implemented in the digital domain with time, space and value discretized in the binary form, many good dynamical properties of chaotic systems in continuous domain may be degraded or even diminish. To measure the dynamic complexity of a digital chaotic system, the dynamics can be transformed to the form of a state-mapping network. Then, the parameters of the network are verified by some typical dynamical metrics of the original chaotic system in infinite precision, such as Lyapunov exponent and entropy. This article reviews some representative works on the network-based analysis of digital chaotic dynamics and presents a general framework for such analysis, unveiling some intrinsic relationships between digital chaos and complex networks. As an example for discussion, the dynamics of a state-mapping network of the Logistic map in a fixed-precision computer is analyzed and discussed.
قيم البحث
اقرأ أيضاً
There is by now a large consensus in modern monetary policy. This consensus has been built upon a dynamic general equilibrium model of optimal monetary policy as developed by, e.g., Goodfriend and King (1997), Clarida et al. (1999), Svensson (1999) a
nd Woodford (2003). In this paper we extend the standard optimal monetary policy model by introducing nonlinearity into the Phillips curve. Under the specific form of nonlinearity proposed in our paper (which allows for convexity and concavity and secures closed form solutions), we show that the introduction of a nonlinear Phillips curve into the structure of the standard model in a discrete time and deterministic framework produces radical changes to the major conclusions regarding stability and the efficiency of monetary policy. We emphasize the following main results: (i) instead of a unique fixed point we end up with multiple equilibria; (ii) instead of saddle--path stability, for different sets of parameter values we may have saddle stability, totally unstable equilibria and chaotic attractors; (iii) for certain degrees of convexity and/or concavity of the Phillips curve, where endogenous fluctuations arise, one is able to encounter various results that seem intuitively correct. Firstly, when the Central Bank pays attention essentially to inflation targeting, the inflation rate has a lower mean and is less volatile; secondly, when the degree of price stickiness is high, the inflation rate displays a larger mean and higher volatility (but this is sensitive to the values given to the parameters of the model); and thirdly, the higher the target value of the output gap chosen by the Central Bank, the higher is the inflation rate and its volatility.
We review our recent work on the synchronization of a network of delay-coupled maps, focusing on the interplay of the network topology and the delay times that take into account the finite velocity of propagation of interactions. We assume that the e
lements of the network are identical ($N$ logistic maps in the regime where the individual maps, without coupling, evolve in a chaotic orbit) and that the coupling strengths are uniform throughout the network. We show that if the delay times are sufficiently heterogeneous, for adequate coupling strength the network synchronizes in a spatially homogeneous steady-state, which is unstable for the individual maps without coupling. This synchronization behavior is referred to as ``suppression of chaos by random delays and is in contrast with the synchronization when all the interaction delay times are homogeneous, because with homogeneous delays the network synchronizes in a state where the elements display in-phase time-periodic or chaotic oscillations. We analyze the influence of the network topology considering four different types of networks: two regular (a ring-type and a ring-type with a central node) and two random (free-scale Barabasi-Albert and small-world Newman-Watts). We find that when the delay times are sufficiently heterogeneous the synchronization behavior is largely independent of the network topology but depends on the networks connectivity, i.e., on the average number of neighbors per node.
We study the chaotic dynamics of graphene structures, considering both a periodic, defect free, graphene sheet and graphene nanoribbons (GNRs) of various widths. By numerically calculating the maximum Lyapunov exponent, we quantify the chaoticity for
a spectrum of energies in both systems. We find that for all cases, the chaotic strength increases with the energy density, and that the onset of chaos in graphene is slow, becoming evident after more than $10^4$ natural oscillations of the system. For the GNRs, we also investigate the impact of the width and chirality (armchair or zigzag edges) on their chaotic behavior. Our results suggest that due to the free edges the chaoticity of GNRs is stronger than the periodic graphene sheet, and decreases by increasing width, tending asymptotically to the bulk value. In addition, the chaotic strength of armchair GNRs is higher than a zigzag ribbon of the same width. Further, we show that the composition of ${}^{12}C$ and ${}^{13}C$ carbon isotopes in graphene has a minor impact on its chaotic strength.
We review the construction of the supersymmetric sigma model for unitary maps, using the color- flavor transformation. We then illustrate applications by three case studies in quantum chaos. In two of these cases, general Floquet maps and quantum gra
phs, we show that universal spectral fluctuations arise provided the pertinent classical dynamics are fully chaotic (ergodic and with decay rates sufficiently gapped away from zero). In the third case, the kicked rotor, we show how the existence of arbitrarily long-lived modes of excitation (diffusion) precludes universal fluctuations and entails quantum localization.
Many important high-dimensional dynamical systems exhibit complex chaotic behaviour. Their complexity means that their dynamics are necessarily comprehended under strong reducing assumptions. It is therefore important to have a clear picture of these
reducing assumptions range of validity. The highly influential chaotic hypothesis of Gallavotti and Cohen states that the large-scale dynamics of high-dimensional systems are effectively hyperbolic, which implies many felicitous statistical properties. We demonstrate, contrary to the chaotic hypothesis, the existence of non-hyperbolic large-scale dynamics in a mean-field coupled system. To do this we reduce the system to its thermodynamic limit, which we approximate numerically with a Chebyshev Galerkin transfer operator discretisation. This enables us to obtain a high precision estimate of a homoclinic tangency, implying a failure of hyperbolicity. Robust non-hyperbolic behaviour is expected under perturbation. As a result, the chaotic hypothesis should not be assumed to hold in all systems, and a better understanding of the domain of its validity is required.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
