Devaney’s chaos implies distributional chaos in a sequence

Let X be a complete metric space without isolated points, and let f:X→X be a continuous map. In this paper we prove that if f is transitive and has a periodic point of period p, then f is distributionally chaotic in a sequence. Particularly, chaos in the sense of Devaney is stronger than distributional chaos in a sequence.     

Noncontinuous maps and Devaney’s chaos

Vu Dong Tô has proven in [1] that for any mapping f: X → X, where X is a metric space that is not precompact, the third condition in the Devaney’s definition of chaos follows from the first two even if f is not assumed to be continuous. This paper completes this result by analysing the precompact case. We show that if X is either finite or perfect one can always find a map f: X → X that satisfies the first two conditions of Devaney’s chaos but not the third. Additionally, if X is neither finite nor perfect there is no f: X → X that would satisfy the first two conditions of Devaney’s chaos at the same time.     

On uniform propagation of chaos

In this paper we obtain a time-uniform propagation estimate for a system of interacting diffusion processes. Using a well defined metric function h , our result guarantees a time-uniform estimate for the convergence of a class of interacting stochastic differential equations towards their mean field limit, under conditions that ensure that the decay associated to the internal dynamics term dominates the interaction and noise terms. Our result should have diverse applications, particularly in neuroscience, and allows for models more elaborate than the one of Wilson and Cowan. In particular, the internal dynamics need not be that of linear decay.     

Distributional chaos for triangular maps

In this paper we exhibit a triangular map F of the square with the following properties: (i) F is of type 2^∞ but has positive topological entropy; we recall that similar example was given by Kolyada in 1992, but our argument is much simpler. (ii) F is distributionally chaotic in the wider sense, but not distributionally chaotic in the sense introduced by Schweizer and Smítal [Trans. Amer. Math. Soc. 344 (1994) 737]. In other words, there are lower and upper distribution functions Φ_xy and Φ_xy^* generated by F such that Φ_xy^*≡1 and Φ_xy(0₊)<1, and no distribution functions Φ_uv, and Φ_uv^* such that Φ_uv^*≡1 and Φ_uv(t)=0 whenever 0<t<ε, for some ε>0. We also show that the two notions of distributional chaos used in the paper, for continuous maps of a compact metric space, are invariants of topological conjugacy.     

Omega limit sets and distributional chaos on graphs

We give a full topological characterization of omega limit sets of continuous maps on graphs and we show that basic sets have similar properties as in the case of the compact interval. We also prove that the presence of distributional chaos, the existence of basic sets, and positive topological entropy (among other properties) are mutually equivalent for continuous graph maps.     

Factor maps and invariant distributional chaos

The main aim of this article is to show that maps with the specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps. This solves some open questions in the literature of the topic.     

The central limit theorem and chaos

Let X be a compact metric space studies some relationships between stochastic and f ： X→ X be a continuous map. This paper and topological properties of dynamical systems. It is shown that if f satisfies the central limit theorem, then f is topologically ergodic and / is sensitively dependent on initial conditions if and only if / is neither minimal nor equicontinuous.     

Abel maps and limit linear series

We explore the relationship between limit linear series and fibers of Abel maps in the case of curves with two smooth components glued at a single node. To an \(r\)-dimensional limit linear series satisfying a certain exactness property (weaker than the refinedness property of Eisenbud and Harris) we associate a closed subscheme of the appropriate fiber of the Abel map. We then describe this closed subscheme explicitly, computing its Hilbert polynomial and showing that it is Cohen–Macaulay of pure dimension \(r\). We show that this construction is also compatible with one-parameter smoothings.     

Suppressing chaos via Lyapunov–Krasovskii’s method

An algorithm for suppressing the chaotic oscillations in non-linear dynamical systems with singular Jacobian matrices is developed using a linear feedback control law based upon the Lyapunov–Krasovskii (LK) method. It appears that the LK method can serve effectively as a generalised method for the suppression of chaotic oscillations for a wide range of systems. Based on this method, the resulting conditions for undisturbed motions to be locally or globally stable are sufficient and conservative. The generalized Lorenz system and disturbed gyrostat equations are exemplified for the validation of the proposed feedback control rule.     

Study on chaos induced by turbulent maps in noncompact sets

This paper is concerned with chaos induced by strictly turbulent maps in noncompact sets of complete metric spaces. Two criteria of chaos for such types of maps are established, and then a criterion of chaos, characterized by snap-back repellers in complete metric spaces, is obtained. All the maps presented in this paper are proved to be chaotic either in the sense of both Li–Yorke and Wiggins or in the sense of both Li–Yorke and Devaney. The results weaken the assumptions in some existing criteria of chaos. Several illustrative examples are provided with computer simulation.     

Generalized uniform covering maps relative to subgroups

In “Rips complexes and covers in the uniform category” (Brodskiy et al., preprint [4]) the authors define, following James (1990) [5], covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform covering maps and generalized uniform covering maps are given. This paper extends these results by investigating the existence of these covering maps relative to subgroups of the uniform fundamental group and the fundamental group of the base space.     

Rademacher chaos: tail estimates versus limit theorems

We study Rademacher chaos indexed by a sparse set which has a fractional combinatorial dimension. We obtain tail estimates for finite sums and a normal limit theorem as the size tends to infinity. The tails for finite sums may be much larger than the tails of the limit.     

A note on transitivity,sensitivity and chaos for graph maps

Two elementary proofs showing that (i) transitivity and sensitivity imply dense periodicity for maps on topological graphs and (ii) total transitivity and dense periodicity imply mixing for maps on spaces with an open subset homeomorphic with the open interval (0,1) are presented. As corollaries, one gets new and simple proofs that Auslander–Yorke chaos implies Devaney chaos, and weak mixing implies mixing for graph maps.     

Measuring transient chaos in nonlinear one- and two-dimensional maps

In this paper, we present results of numerical experiments on chaotic transients in families of the logistic and Hénon maps. The duration of chaotic transients (the rambling time) for logistic maps estimated according to a rigorous criterion shows monotonic regularities with respect to both the period and the number of periodic window in a series of a given period. Due to inapplicability of this criterion to multidimensional maps, a more universal, though approximate, criterion is systematically studied on the family of logistic maps to optimize a choice of the free parameter value. The same approximate criterion is used to estimate rambling time for a number of periodic windows for the family of Hénon maps. The dependence of the rambling time on the width of periodic windows is tested.     

On open problems concerning distributional chaos for triangular maps

We show that in the class T of the triangular maps (x,y)?(f(x),g_x(y)) of the square there is a map of type 2^∞ with non-minimal recurrent points which is not DC3. We also show that every DC1 continuous map of a compact metric space has a trajectory which cannot be (weakly) approximated by trajectories of compact periodic sets. These two results make possible to answer some open questions concerning classification of maps in T with zero topological entropy, and contribute to an old problem formulated by A.N. Sharkovsky.     

Generalized Hermite processes,discrete chaos and limit theorems

We introduce a broad class of self-similar processes {Z(t),t≥0}$\{Z\left(t\right),t\ge 0\}$ called generalized Hermite processes. They have stationary increments, are defined on a Wiener chaos with Hurst index H∈(1/2,1)$H\in (1/2,1)$, and include Hermite processes as a special case. They are defined through a homogeneous kernel g$g$, called the “generalized Hermite kernel”, which replaces the product of power functions in the definition of Hermite processes. The generalized Hermite kernels g$g$ can also be used to generate long-range dependent stationary sequences forming a discrete chaos process {X(n)}$\left\{X\left(n\right)\right\}$. In addition, we consider a fractionally-filtered version Z^β(t)$Z^{\beta }\left(t\right)$ of Z(t)$Z\left(t\right)$, which allows H∈(0,1/2)$H\in (0,1/2)$. Corresponding non-central limit theorems are established. We also give a multivariate limit theorem which mixes central and non-central limit theorems.     

An empirical central limit theorem for intermittent maps

We prove an empirical central limit theorem for the distribution function of a stationary sequence, under a dependence condition involving only indicators of half line. We show that the result applies to the empirical distribution function of iterates of expanding maps with a neutral fixed point at zero as soon as the correlations are summable.