Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
1984, Journal of Statistical Physics
We consider single-humped symmetric one-dimensional maps generating fully developed chaotic iterations specified by the property that on the attractor the mapping is everywhere two to one. To calculate the probability distribution function, and in turn the Lyapunov exponent and the correlation function, a perturbation expansion is developed for the invariant measure. Besides deriving some general results, we treat several examples in detail and compare our theoretical results with recent numerical ones. Furthermore, a necessary condition is deduced for the probability distribution function to be symmetric and an effective functional iteration method for the measure is introduced for numerical purposes.
Chaos: An Interdisciplinary Journal of Nonlinear Science, 1993
One-dimensional maps with complete grammar are investigated in both permanent and transient chaotic cases. The discussion focuses on statistical characteristics such as Lyapunov exponent, generalized entropies and dimensions, free energies, and their finite size corrections. Our approach is based on the eigenvalue problem of generalized Frobenius-Perron operators, which are treated numerically as well as by perturbative and other analytical methods. The examples include the universal chaos function relevant near the period doubling threshold. Special emphasis is put on the entropies and their decay rates because of their invariance under the most general class of coordinate changes. Phase-transition-like phenomena at the border state of chaos due to intermittency and super instability are presented.
Journal of Applied Mathematics and Physics, 2019
In this article, we have discussed basic concepts of one-dimensional maps like Cubic map, Sine map and analyzed their chaotic behaviors in several senses in the unit interval. We have mainly focused on Orbit Analysis, Time Series Analysis, Lyapunov Exponent Analysis, Sensitivity to Initial Conditions, Bifurcation Diagram, Cobweb Diagram, Histogram, Mathematical Analysis by Newton's Iteration, Trajectories and Sensitivity to Numerical Inaccuracies of the said maps. We have tried to make decision about these mentioned maps whether chaotic or not on a unique interval of parameter value. We have performed numerical calculations and graphical representations for all parameter values on that interval and have tried to find if there is any single value of parameter for which those maps are chaotic. In our calculations we have found there are many values for which those maps are chaotic. We have showed numerical calculations and graphical representations for single value of the parameter only in this paper which gives a clear visualization of chaotic dynamics. We performed all graphical activities by using Mathematica and MATLAB.
2015
Chaotic functions because of their complexity and random nature are used in the cryptographic networks. Chaotic functions are one dimensional, two dimensional, three dimensional in nature. One dimensional chaotic functions are usually implemented in cryptographic algorithms. In this paper two chaotic one dimensional function have been analyzed and compared on the basis of Average, Standard Deviation and Entropy.
Pramana-journal of Physics, 1992
This paper is a review of the present status of studies relating to occurrence of deterministic chaos and its characterization in one-dimensional maps. As our primary aim is to introduce the nonspecialists into this fascinating world of chaos we start from very elementary concepts and give sufficient arguments for clarity of ideas. The two main scenarios during onset of chaos viz. the period doubling and intermittency are dealt with in detail. Although the logistic map is often discussed by way of illustration, a few more interesting maps are mentioned towards the end.
Symmetry
In this work, a family of piecewise chaotic maps is proposed. This family of maps is parameterized by the nonlinear functions used for each piece of the mapping, which can be either symmetric or non-symmetric. Applying a constraint on the shape of each piece, the generated maps have no equilibria and can showcase chaotic behavior. This family thus belongs to the category of systems with hidden attractors. Numerous examples of chaotic maps are provided, showcasing fractal-like, symmetrical patterns at the interchange between chaotic and non-chaotic behavior. Moreover, the application of the proposed maps to a pseudorandom bit generator is successfully performed.
2018
In this paper, we study basic dynamical behavior of one-dimensional Doubling map. Especially emphasis is given on the chaotic behaviors of the said map. Several approaches of chaotic behaviors by some pioneers it is found that the Doubling map is chaotic in different senses. We mainly focused on Orbit Analysis, Sensitivity to Initial Conditions, Sensitivity to Numerical Inaccuracies, Trajectories and Staircase Diagram of the Doubling map. The graphical representations show that this map is chaotic in different senses. The behavior of the said map is found irregular, that is, chaotic.
International Journal of Bifurcation and Chaos, 2002
Cycling behavior involving steady-states and periodic solutions is known to be a generic feature of continuous dynamical systems with symmetry. Using Chua's circuit equations and Lorenz equations, Dellnitz et al. [1995] showed that "cycling chaos", in which solution trajectories cycle around symmetrically related chaotic sets, can also be found generically in coupled cell systems of differential equations with symmetry. In this work, we use numerical simulations to demonstrate that cycling chaos also occurs in discrete dynamical systems modeled by one-dimensional maps. Using the cubic map f (x, λ) = λx - x3 and the standard logistic map, we show that coupled iterated maps can exhibit cycles connecting fixed points with fixed points and periodic orbits with periodic orbits, where the period can be arbitrarily high. As in the case of coupled cell systems of differential equations, we show that cycling behavior can also be a feature of the global dynamics of coupled itera...
We generate new hierarchy of many-parameter family of maps of the interval [0, with an invariant measure, by composition of the chaotic maps of reference . Using the measure, we calculate Kolmogorov-Sinai entropy, or equivalently Lyapunov characteristic exponent, of these maps analytically, where the results thus obtained have been approved with numerical simulation. In contrary to the usual one-dimensional maps and similar to the maps of reference [1], these maps do not possess period doubling or period-n-tupling cascade bifurcation to chaos, but they have single fixed point attractor at certain region of parameters values, where they bifurcate directly to chaos without having period-n-tupling scenario exactly at these values of parameter whose Lyapunov characteristic exponent begins to be positive.
Chaos, Solitons & Fractals, 2017
This paper deals with a family of interesting 2 D-quadratic maps proposed by Sprott, in his seminal paper [1], related to "chaotic art". Our main interest about these maps is their great potential for using them in digital electronic applications because they present multiple chaotic attractors depending on the selected point in the parameter's space. Only results for the analytical representation of these maps have been published in the open literature. Consequently, the objective of this paper is to extend the analysis to the digital version, to make possible the hardware implementation in a digital medium, like field programmable gate arrays (FPGA) in fixed-point arithmetic. Our main contributions are: (a) the study of the domains of attraction in fixed-point arithmetic, in terms of period lengths and statistical properties; (b) the determination of the threshold of the bus width that preserves the integrity of the domain of attraction and (c) the comparison between two quantifiers based on respective probability distribution functions (PDFs) and the well known maximum Lyapunov exponent (MLE) to detect the above mentioned threshold.
Physica A: Statistical Mechanics and its Applications, 1996
We discuss the characterization of chaotic behaviours in random maps both in terms of the Lyapunov exponent and of the spectral properties of the Perron-Frobenius operator. In particular, we study a logistic map where the control parameter is extracted at random at each time step by considering finite dimensional approximation of the Perron-Frobenius operator.
International Journal of Electrical and Computer Engineering (IJECE), 2025
These days, keeping information safe from people who should not have access to it is very important. Chaos maps are a critical component of encryption and security systems. The classical one-dimensional maps, such as logistic, sine, and tent, have many weaknesses. For example, these classical maps may exhibit chaotic behavior within the narrow range of the rate variable between 0 and 1and the small interval's rate variable. In recent years, several researchers have tried to overcome these problems. In this paper, we propose a new one-dimensional chaotic map that improves the sine map. We introduce an additional parameter and modify the mathematical structure to enhance the chaotic behavior and expand the interval's rate variable. We evaluate the effectiveness of our map using specific tests, including fixed points and stability analysis, Lyapunov exponent analysis, diagram bifurcation, sensitivity to initial conditions, the cobweb diagram, sample entropy and the 0-1 test.
Symmetry
In this paper, we propose two new two-dimensional chaotic maps with closed curve fixed points. The chaotic behavior of the two maps is analyzed by the 0–1 test, and explored numerically using Lyapunov exponents and bifurcation diagrams. It has been found that chaos exists in both fractional maps. In addition, result shows that the proposed fractional maps shows the property of coexisting attractors.
Journal of Applied Mathematics and Stochastic Analysis, 2004
Letρ(x,t)denote a family of probability density functions parameterized by timet. We show the existence of a family{τ1:t>0}of deterministic nonlinear (chaotic) point transformations whose invariant probability density functions are preciselyρ(x,t). In particular, we are interested in the densities that arise from the diffusions. We derive a partial differential equation whose solution yields the family of chaotic maps whose density functions are precisely those of the diffusion.
EURASIP Journal on Advances in Signal Processing, 2016
We introduce in this paper a new chaotic map with dynamical properties controlled by two free parameters. The map definition is based on the hyperbolic tangent function, so it is called the tanh map. We demonstrate that the Lyapunov exponent of the tanh map is robust, remaining practically unaltered with the variation of its parameters. As the main application, we consider a chaotic communication system based on symbolic dynamics with advantages over current approaches that use piecewise linear maps. In this context, we propose a new measure, namely, the spread rate, to study the local structure of the chaotic dynamics of a one-dimensional chaotic map.
Journal of Mathematical Physics, 2003
Hierarchy of one and many-parameter families of random trigonometric chaotic maps and one-parameter random elliptic chaotic maps of cn type with an invariant measure have been introduced. Using the invariant measure (Sinai-Ruelle-Bowen measure), the Kolmogrov-Sinai entropy of the random chaotic maps have been calculated analytically, where the numerical simulations support the results .
Computers & Mathematics with Applications, 1996
An algorithm is proposed whereby any chaotic transformation r (i.e., one merely possessing a dense orbit) can be modified slightly to r* in order to attain a desired target probability density function f*. The algorithm can be used in practical examples such as controlling the long term population distribution of a species whose dynamics is described by a point transformation. Keywords-Control of dynamical system, Probability density function absolutely continuous invariant measure, Markov maps.
In this paper a two dimensional non linear map is taken whose period doubling dynamical behavior has been analyzed. The bifurcation points have been calculated numerically and have been observed that the map follows a universal behavior that has been proposed by Feigenbaum. With the help of experimental bifurcation points the accumulation point where chaos starts has been calculated.
2020 IEEE Recent Advances in Intelligent Computational Systems (RAICS), 2020
In this paper, a rigorous analysis of the behavior of the standard logistic map, Logistic Tent system (LTS), Logistic-Sine system (LSS) and Tent-Sine system (TSS) is performed using 0-1 test and three state test (3ST). In this work, it has been proved that the strength of the chaotic behavior is not uniform. Through extensive experiment and analysis, the strong and weak chaotic regions of LTS, LSS and TSS have been identified. This would enable researchers using these maps, to have better choices of control parameters as key values, for stronger encryption. In addition, this paper serves as a precursor to stronger testing practices in cryptosystem research, as Lyapunov exponent alone has been shown to fail as a true representation of the chaotic nature of a map.
The purpose of this paper is to show explicitly the spectral distribution function of some stationary stochastic processes as
2011
Abstract We analyse deterministic diffusion in a simple, one-dimensional setting consisting of a family of four parameter dependent, chaotic maps defined over the real line. When iterated under these maps, a probability density function spreads out and one can define a diffusion coefficient. We look at how the diffusion coefficient varies across the family of maps and under parameter variation.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.