اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدChaotic waves serve as universal pattern generators
172
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Excitable media are prevalent models for describing physical, chemical, and biological systems which support wave propagation. In this letter, we show that the time evolution of the medium state at the wave fronts can be determined by complicated chaotic attractors. Wave front dynamics can be controlled by initial data choice. Building on this groundwork, we show that there is a mechano-chemical analog of the Universal Turing machine for morphogenesis problems. Namely, a fixed mechano-chemical system can produce any prescribed cell pattern depending on its input (initial data). This universal mechanism uses fundamental physical effects: spontaneous symmetry breaking with formation of many interfaces (kinks), which interact non-locally via a fast diffusing reagent. This interaction creates chaos. We present algorithms allowing us to obtain a prescribed target cell pattern.
قيم البحث
اقرأ أيضاً
We deal with randomness-quantifiers and concentrate on their ability do discern the hallmark of chaos in time-series used in connection with pseudo random number generators (PRNG). Workers in the field are motivated to use chaotic maps for generating
PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we feel that the analysis provided here sheds additional didactic light on the importance of the main statistical characteristics of a chaotic map, namely, i) its invariant measure and ii) the mixing constant. This is of help in answering two questions that arise in applications, that is, (1) which is the best PRNG among the available ones? and (2) If a given PRNG turns out not to be good enough and a randomization procedure must still be applied to it, which is the best applicable randomization procedure?. Our answer provides a comparative analysis of several quantifiers advanced in the extant literature.
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.
Oscillatory dynamics of complex networks has recently attracted great attention. In this paper we study pattern formation in oscillatory complex networks consisting of excitable nodes. We find that there exist a few center nodes and small skeletons f
or most oscillations. Complicated and seemingly random oscillatory patterns can be viewed as well-organized target waves propagating from center nodes along the shortest paths, and the shortest loops passing through both the center nodes and their driver nodes play the role of oscillation sources. Analyzing simple skeletons we are able to understand and predict various essential properties of the oscillations and effectively modulate the oscillations. These methods and results will give insights into pattern formation in complex networks, and provide suggestive ideas for studying and controlling oscillations in neural networks.
Two replicas of spatially extended chaotic systems synchronize to a common spatio-temporal chaotic state when coupled above a critical strength. As a prototype of each single spatio-temporal chaotic system a lattice of maps interacting via power-law
coupling is considered. The synchronization transition is studied as a non-equilibrium phase transition, and its critical properties are analyzed at varying the spatial interaction range as well as the nonlinearity of the dynamical units composing each system. In particular, continuous and discontinuous local maps are considered. In both cases the transitions are of the second order with critical indexes varying with the exponent characterizing the interaction range. For discontinuous maps it is numerically shown that the transition belongs to the {it anomalous directed percolation} (ADP) family of universality classes, previously identified for L{e}vy-flight spreading of epidemic processes. For continuous maps, the critical exponents are different from those characterizing ADP, but apart from the nearest-neighbor case, the identification of the corresponding universality classes remains an open problem. Finally, to test the influence of deterministic correlations for the studied synchronization transitions, the chaotic dynamical evolutions are substituted by suitable stochastic models. In this framework and for the discontinuous case, it is possible to derive an effective Langevin description that corresponds to that proposed for ADP.
Quantum walks and random walks bear similarities and divergences. One of the most remarkable disparities affects the probability of finding the particle at a given location: typically, almost a flat function in the first case and a bell-shaped one in
the second case. Here I show how one can impose any desired stochastic behavior (compatible with the continuity equation for the probability function) on both systems by the appropriate choice of time- and site-dependent coins. This implies, in particular, that one can devise quantum walks that show diffusive spreading without loosing coherence, as well as random walks that exhibit the characteristic fast propagation of a quantum particle driven by a Hadamard coin.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
