Abstract
Chaos is a common phenomenon in nature and social sciences. As is well known, chaos has multiple definitions, and there are both differences and connections between them. The unique properties of chaotic systems can be leveraged to address challenges in communication, security, data processing, system analysis, and control across different domains. For semi-flows, this paper introduces two important concepts corresponding to discrete dynamical systems, finitely chaotic and pairwise sensitivity. Since Tent map and its induced suspended semi-flows both have these two properties, then these two concepts on the semi-flows have extensive and important applications and meanings in information security, finance, artificial intelligence and other fields. This paper extends the vast majority of corresponding results in discrete dynamical systems to semi-flows.
MSC:
37B55; 37B45; 54H20
1. Introduction
To understand chaos in a topologically transitive semi-flows, we first recall some key concepts involved in this paper. A semi-flow on a (nonempty) set M is a map , satisfying and . It is a mathematical abstraction used to describe a continuous-time dynamical system. It consists of a set (phase space) and a family of continuous functions that represent the evolution of the system over time. Each function describes the behavior of the system for positive time values. In the context of dynamical systems, finite chaoticity refers to the property of a system where chaotic behavior is observed only for a finite subset of the phase space while outside this region, the behavior may be regular or non-chaotic. Pairwise sensitivity of a strong-mixing measure refers to a property of a dynamical system, specifically a measure-preserving system, which captures the sensitivity of the system to small changes in initial conditions in a pairwise manner. A measure-preserving system means that this measure captures the probability distribution or density of points in the phase space and is preserved by the dynamics of the system. Strong mixing is a property of measure-preserving systems that indicates the rapid and complete mixing of subsets of the phase space as time progresses. Strong mixing implies that the system’s dynamics thoroughly mix the points in the phase space, resulting in a high level of randomness and unpredictability. Pairwise sensitivity refers to the sensitivity of a dynamical system to small changes in initial conditions in a pairwise manner. So, even though the overall dynamics of the system may be mixing and chaotic, the pairwise sensitivity property specifically focuses on the divergence of nearby trajectories.
Smítal [1] proved that for the tent map defined on , there exists a set C with Lebesgue outer measure such that for any and a periodic point p of H with ,
and
where . Periodic point is such that for every . s is called a period of H if it is the minimum positive integer which satisfying . And is a period orbit of H. A stronger result than Smítal’s has been proven by Chen [2] for the tent map on space I (resp. the shift of symbolic space). Later, in [3], Xiong and Chen discusses chaotic behavior caused by strong mixing preserving measure mappings and proves that the above result in [1] is a special case. The main result is then applied to one-dimensional mappings. They also proved a statement for a topological space M satisfying the second countability axiom and an outer measure on M satisfying the following conditions (i)–(iii). If is a strong-mixing measure-preserving map on the probability space , and is a strictly increasing sequence of positive real numbers, then there is a set such that C is finitely chaotic with respect to the sequence . Where,
- (i)
- any nonempty open subset is -measurable with ;
- (ii)
- the restriction of to the sigma-algebra of Borel subsets of M is a probability space;
- (iii)
- for each subset V of M, there exists a Borel set satisfying and if a Borel set , then . And then, .
Furthermore, for every finite subset and each map , there exists a subsequence of such that
for all .
One of the necessary conditions for various definitions of chaos [4,5,6,7,8] is sensitivity, which characterizes the unpredictability of chaos in dynamical systems, as is widely acknowledged. In recent years, there has been a widespread interest in the concept of sensitive dependence on initial conditions [5,9,10,11,12,13], which has been formalized in various ways by several authors [14,15,16,17,18]. In order to illustrate the exponential rate of divergence of neighboring point trajectories, Ref. [19] first used the phrase “sensitive dependence on initial conditions”. In a more general sense, the sensitivity property is a characterization of the dynamical behavior in which even a small change in the initial condition can result in a significant change in the resulting trajectory.
Based on the earlier work of Guckenheimer [20], Devaney [6] gave a mathematical definition of sensitivity as follows. Let H be a continuous self-map on a metric space . H is sensitive if there is an such that for any and , there always exists a with satisfying the condition that
for some integer m. In the past few years, some authors have proposed sufficient conditions on H and to ensure sensitivity (see [5,10,11,12,13,14,20,21,22]). In [14], the authors demonstrate that on a Borel probability space of supp , if the measure preserving map H is topologically mixing (or weakly mixing), then for all non-empty open set , there exists a sequence of positive integers with positive upper density satisfying that
then it is sensitive. By proving weak-mixing to be sufficient, in [10] He reduced the conditions required for sensitive dependence on a metric probability space with supp for both measure-preserving maps and measure-preserving semi-flows. Recently, Gu [23] showed that H is sensitive on a nontrivial compact metric space M if the pair satisfies the large deviation theorem (where H is continuous and topological strongly ergodic). Moreover, according to [24] (Proposition 7.2.14), topological mixing of the mapping H in [23] provides sensitivity. In addition, Ref. [16] offers some sufficient conditions for sensitivity that are more general and relaxed than the conditions presented in [10,14,23,24,25]. However, in chaos theory, sensitivity to initial conditions was first proposed with the measure of divergence of neighboring point trajectories, similar to the butterfly effect described by Lorenz (see [6]). To avoid the asymmetry in the definition of sensitivity mentioned above, the authors [18] gave the definition of pairwise sensitivity by using the tools from ergodic theory. Where, a map is topologically ergodic (briefly, ergodic) if has positive upper density for any non-empty open sets . That is, .
The first purpose of the current research is to define the notion of finite chaos with respect to a sequence for a semi-flow (which may not be continuous), and to extend the results of Xiong and Chen in [3] to semi-flows. In particular, the following conditions are satisfied by the establishment of a topological space M with the second axiom of countability and an outer measure on it.
- (1)
- any nonempty open subset is -measurable with ;
- (2)
- the restriction of to the sigma-algebra of Borel subsets of M is a probability space;
- (3)
- if is a probability space with a strong-mixing measure-preserving semi-flow , then for any subset V of M, there is a Borel set . And then, there exists a set with that is finitely chaotic with respect to a strictly increasing sequence . That is, for any finite subset and every map there exists a subsequence of withfor any .
Additionally, the notion of pairwise sensitivity is presented for semi-flows on Lebesgue metric spaces in this paper. The link between pairwise sensitivity, weak mixing, and pairwise sensitivity for semi-flows is examined, along with the positiveness of metric entropy. Moreover, we also calculated the maximum sensitivity constants for specific semi-flows.
2. Preliminaries
Let M a topological space and be a map (which may not be continuous).
Definition 1
([3]). A set is said to be finitely chaotic with respect to the strictly increasing sequence , if for all finite subsets and for every map there exists a subsequence of satisfying that
for all .
The corresponding concept for a semi-flow is given as follow.
Definition 2.
Let be a semi-flow. A set is said to be finitely chaotic with respect to the strictly increasing sequence , if for all finite subset and every map there exists a subsequence of satisfying that
for all .
Remark 1.
According to the definition, a set is finitely chaotic with respect to the sequence if and only if any finite subset is finitely chaotic with respect to the sequence .
By the first statement of Proposition 1 in [3], a set with finite chaos with respect to a sequence of positive integers is chaotic in the sense of Li-Yorke [26,27,28]. From the second statement of Proposition 1 in [3], for certain distinct sequences of positive integers, sets with finite chaos satisfy the conditions described by Smítal in [1]. By utilizing Proposition 1 and Remark 3 in [3], it is established that a set possessing finite chaos with respect to a sequence of positive integers is categorized as strongly chaotic (as outlined in [29]), but not necessarily chaotic (for further information on the concept of chaos, please refer to [30]). In regards to semi-flows, the following result is offered, which is similar to Proposition 1 in [3].
Proposition 1.
Let be a semi-flow, ρ is a metric on M. And let be a set, finitely chaotic with respect to a strictly increasing sequence . Then, for any two different points and any periodic point p of φ,
and
are held, where is the diameter of M.
Proof.
Let . Choose satisfying
For any , a map is defined by and . For any , by Definition 2, there is a subsequence of satisfying that
and
And because
then
Define a map by and . Then, there is a subsequence of the sequence such that
and
Hence, one has
Let p be a periodic point of with . It is clear that if M is a periodic orbit of then
Assuming that M does not represent a periodic orbit of , it is feasible to locate a point that is not included in the periodic orbit of where p is included. Then, there exists a subsequence of satisfying that
For each , since is in the periodic orbit of which p belongs to, then
where is the distance between p and the periodic orbit of containing the points z. One has that
Thus, the proof is ended. □
In the following there is always assume that represents a nontrivial metric space. A probability measure on is denoted by with serving as the sigma-algebra of Borel subsets of M. Thus, the space M is identified as a metric probability space and can be represented as or .
A measurable mapping F is said to be measure-preserving on if for all [31]. A measurable semi-flow is said to be measure-preserving on if
for all and all .
A measure-preserving mapping F on is said to be strong-mixing if for every of ,
is held.
For semi-flows, one has the following analogous definition.
Definition 3.
Provided that is a probability Lebesgue space with a metric ρ, a measure-preserving semi-flow φ can be considered as strong-mixing when
holds for all of .
By [31], a measure-preserving mapping F on is said to be weakly mixing if for every U and V of ,
Similarly, a measure-preserving semi-flow φ on is said to be weakly mixing if for every U and V of , one has
where denotes absolute value.
A mapping (resp. a semi-flow φ) is sensitive if there exists an satisfying that for every and every neighborhood , there exists (resp. ) such that sup (resp. sup).
The following definition is analogous to the definition of paired sensitivities for measure-preserving maps as defined by B. Cadre and P. Jacob in [31].
Definition 4.
A semi-flow φ on a probability Lebesgue space with a metric ρ is called to be paired sensitivities (relative to the initial condition) if there is an such that for almost everywhere measure in and , there exist some proper satisfying
A semi-flow φ is said to be pairwise sensitive if there is an satisfying that
where is the semi-flow on defined as
for any and any , and
for any .
3. Main Results
In order to derive the principal outcomes of this paper, we require the following three lemmas, which are semi-flow versions of Lemmas 1–3 initially presented in [3].
Lemma 1.
Let be a semi-flow (which may not be continuous), where M is a topological space, and is a strictly increasing sequence. Let be dense in M and be a given set. If for all finite subsets and all mappings there exists a subsequence of satisfying that
for any , then A is a finite chaotic set with respect to the sequence .
Proof.
Let be a mapping, where is a finite set. For every , let be a locally countable base of such that is open, and
for any . For each , take
Define by
for any . By the conditions of this Lemma, there is a subsequence of satisfying that
for every and any .
Define a subsequence of as follows. By assumption of a base, one can choose some such that and set . Then, for a given real number and for , choose such that and for every . One has that
for any . So, A is a finite chaotic set with respect to the sequence . □
Lemma 2.
Let be a strong-mixing semi-flow, where be a probability space. Then, for each with and any strictly increasing sequence ,
Proof.
Let , where . Then
Since is a strong-mixing semi-flow, then
which implies that
□
Lemma 3.
Let be a Borel probability space satisfying the condition that is positive for each nonempty open subset which satisfies the second axiom of countability. Let be a strictly increasing sequence, and be a strong-mixing semi-flow. If C is finitely chaotic with respect to the sequence , and if C is countable, then there is a set satisfying that
- (1)
- ;
- (2)
- for any , is finitely chaotic with respect to the sequence .
Proof.
The discussion is divided into two cases.
(i) Assume that C is a finite set and finitely chaotic with respect to the sequence . Let is a family of sets which includes all non-empty open sets of a countable base of M. Let Y be a countable dense set of M. Consider to be the collection of all maps from C into Y. Clearly, is countable.
Since the set C is finitely chaotic with respect to the sequence , then for any map there exists a subsequence of the sequence such that
for any . Write
where
Then for every . So, , which implies . By Lemma 2, for any . This means for any map . By the definition of the set , it follows that for any and any there exists a subsequence of such that So, for any .
For each , let
be a map such that Then, by the above argument, there is a subsequence of satisfying that
for any By Lemma 1 and Definition 2, is finitely chaotic with respect to the sequence for any , where
Then,
(ii) Assume that C is a countable set and finitely chaotic with respect to the sequence . Let denotes the collection of all finite subsets of C which is evidently countable. Write
Then, by the above argument and the definition of , one has that
For any , let
be a finite set and be a map. If , then B is finitely chaotic with respect to some sequence . If B is not a subset of C and
for some and some , then, by the above argument, B is finitely chaotic with respect to the sequence . So, there is a subsequence of the sequence satisfying that
for any . Thus, is required. □
Now Theorem 1 in [3] can be extended to semi-flows as follow.
Theorem 1.
Let be a probability space satisfies that, for all nonempty open subset fit for the second axiom of countability. Let be a strictly increasing sequence and be a strong-mixing semi-flow. Then there is a set such that
- (1)
- ;
- (2)
- for any and any , there exists a subsequence of satisfying
Proof.
(1) Consider the collection to be comprised of all non-empty open sets that form a countable base for M. Write
where
Then for any integer . So, , which implies By Lemma 2,
for any integer . This means . Thus, the set C is required.
(2) By the definition of the set C, the conclusion follows immediately. □
The following theorem is the semi-flow version of Theorem 2 from [3].
Theorem 2.
Let be a probability space. is positive for all nonempty open subset satisfying the second axiom of countability. Let be a strictly increasing sequence and be a strong-mixing semi-flow. A set that is finitely chaotic with respect to the sequence can be found such that and imply .
Proof.
The proof is similar to that of Theorem 2 in [3]. For the completeness, we provide its proof here.
Since the space M satisfies the second axiom of countability, the cardinal number is smaller than that of a continuum. By the reference [8] in [3], the cardinal number is smaller than that of a continuum. Therefore, the cardinal number is also smaller than that of a continuum. So, can be denoted by , where represents a finite number m, or ∞, or the first uncountable ordinal number .
Define points for every with by induction (in the case , by transfinite induction) which satisfies that is finitely chaotic with respect to the sequence for each with .
Assume that E is a set which satisfies conditions (1) and (2) of Lemma 3. By condition (1) of Theorem 1, . Pick . By condition (1) of Theorem 1, is finitely chaotic with respect to the sequence . Since , then one can pick a point for every such that is finitely chaotic with respect to the sequence for each with . Obviously, is countable. It is easy to see that the set C is finitely chaotic with respect to the sequence . By Lemma 3, there exists a set which satisfies conditions (1) and (2). By condition (1) of Lemma 3, . Take . By condition (1) of Lemma 3, the set is finitely chaotic with respect to the sequence . Clearly, for each . □
The following result is the semi-flow version of Theorem 3 in [3].
Theorem 3.
Assume that M is a topological space that satisfies the second axiom of countability, μ is an outer measure on M satisfying and for any nonempty open subset , and is a strong-mixing semi-flow. If
- (1)
- each open subset of M is μ-measurable, that is, each is μ-measurable;
- (2)
- for any subset there exists a set with andthen, for any strictly increasing sequence there exists a with which is finitely chaotic with respect to the sequence .
Proof.
By Theorem 2, there exists a set C such that for any with . So, there exists a which satisfies and . If , then . It is a contradiction. This means that . Hence, . In addition, conditions (1) and (2) in Theorem 3 are easy to satisfy by an outer measure (This can be obtained from the last part of the proof of Theorem 3 in [3]). Thus, the conclusion is held. □
According to the definition of sensitive, if is a sensitivity constant for a semi-flow , then also is a sensitivity constant. Write
and
Since the support of is not a single point, there is a such that
Consequently, .
In order to demonstrate Theorem 4, which presents the semi-flow version of Theorem 2.1 in [18], the following lemma, which corresponds to the semi-flow version of Lemma 2.1 in [18], is required.
Lemma 4.
Assume that is a pairwise sensitive semi-flow on , where M is a nontrivial metric space. Then diam(supp ).
Proof.
Since
for any , where diam(supp , . Write supp for any . Due to is a closed subset and supp supp supp , one has
And because
then, . Consequently, diam(supp ). □
Theorem 4.
Assume that φ is a pairwise sensitive semi-flow on , where M is a nontrivial metric space. Then the following hold.
- (1)
- there is an , for almost everywhere measure and , there is a sequence satisfying thatfor any integer ;
- (2)
- for almost everywhere measure and ,
- (3)
- diam(supp μ).
Proof.
(1) For , let
Write
If , then there exists a real number sequence satisfying
for any integer . Since
for any integer , then for each , one has
It remains to show
In fact, since is a measure-preserving semi-flow,
for all . Clearly, . Therefore, one can get that
(2) If is pairwise sensitive, it follows that for some sufficiently small ,
Therefore, based on a monotonicity argument, it can be concluded that
Since
for almost everywhere measure and , one has
(3) Hypothesis that
Since is pairwise sensitive, then
and for all . This a contradiction. Therefore,
Consequently, by Lemma 4, (3) is true. □
The theorem presented below corresponds to the semi-flow version of Theorem 2.2 in [18].
Theorem 5.
Assume that M is a nontrivial metric space and φ is a weakly mixing semi-flow on . Then, φ is pairwise sensitive, and diam(supp μ).
Proof.
Let diam(supp ). Since is weakly mixing, then is weakly mixing, which implies that is ergodic [32]. By the definition and the ergodicity of , one has
By Lemma 4,
So,
Consequently, is pairwise sensitive and diam(supp ). By Theorem 4 (3), diam(supp ). Thus, the theorem is true. □
Obviously, for almost everywhere measure and , one has
Then, the following corollary is the semi-flow version of Corollary 2.1 in [18] and is a straightforward consequence of Theorem 4 (2) and Theorem 5.
Corollary 1.
Assume that M is a nontrivial metric space and φ is a weakly mixing semi-flow on . Then, for almost everywhere measure and , one has
Assume that is a measurable countable partition of M, the metric entropy of transformation with respect to the partition is denoted by (see [33]). It is widely accepted, although the definition of sensitivity may different, while positive metric entropy implies sensitivity (see [8,14,34]). The subsequent theorem provides a partial response in the context of pairwise sensitivity for semi-flows.
If are satisfying that and , then it is called that is a finite partition of M.
Theorem 6.
Assume that φ is a weakly mixing semi-flow on , where M is a nontrivial metric space. Taking such that is ergodic. Within this context, a finite measurable partition
of M is considered.
Assuming that are μ-continuity sets for ρ, and then φ is pairwise sensitive.
Proof.
Without loss of generality, it is possible to assume that
Given any and any , let denote the internal -boundary of A, that is,
Let
Since the are -continuity sets, it follows that
Therefore, one can select such that
By Theorem 3.1 in [18] and its proof,
Since
then
Thus, by the definition, is pairwise sensitive. □
4. Applications
Let a selfmap f on a compact metric space be continuous. One can define an equivalence relation ‘∼’ in the product space as follows. For any . if and only if one of the following conditions hold: (1) ; (2) and .
Let . By [35], W is compact and metrizable. Then the suspended semi-flow induced by it on W is defined as for any and any with and k is a nonnegative integer.
Example 1.
For a continuous map , if is finitely chaotic with respect to a monotonically increasing sequence of positive integers, then for a suspended semi-flow of f, A is also finitely chaotic with respect to a positive integers sequence. On the contrary, for a semi-flow , if A is finitely chaotic with respect to a monotonically increasing unbounded sequence , then for f, A is finitely chaotic with respect to sequence , where is the integer part of .
Proof.
Let is a monotonically increasing sequence of positive integers and A is finitely chaotic with respect to . Then, for every finite subset and every continuous mapping , there exists a subsequence of such that . By the definition of , . Then for , A is finitely chaotic with respect to .
On the contrary, let is a monotonically increasing unbounded sequence, and for suspend semi-flow , A is finitely chaotic with respect to . Then, for every finite subset and every continuous mapping , there exists a subsequence of such that . By the definition of , . Thus, for f, A is finitely chaotic with respect to . □
Example 2.
A continuous map is pairwise sensitive if and only if its suspended semi-flow is pairwise sensitive, and the sensitivity constants can be the same.
Proof.
Let f is pairwise sensitive with the sensitivity constant . Then, for almost everywhere measure and , there exists a integer such that . This implies that . Thus, is pairwise sensitive with the sensitivity constant .
On the contrary, if is pairwise sensitive with the sensitivity constant , then for almost everywhere measure and , there exists a real number such that . So, . That is, f is pairwise sensitive with the sensitivity constant . □
Example 3.
Assume that the semi-flow of f satisfies the conditions of Theorem 4, and is a monotonically increasing unbounded sequence, then the conclusion of Theorem 4 also holds for f and integer sequence .
Proof.
By the proof of Example 2, is pairwise sensitive if and only if f is pairwise sensitive. And because , then if and only if . Thus, the proof is completed. □
5. Conclusions
For semi-flows, the relationship between pairwise sensitivity and weak mixing, the relationship between pairwise sensitivity and positiveness of metric entropy are studied in this research. Moreover, the largest sensitivity constant for some semi-flows is computed.
While, one may object that the present study assumes idealized conditions, such as perfect precision, complete determinism, and infinite computational resources. Real-world systems are subject to various sources of noise, uncertainties, and limitations in measurement accuracy and computational resources. The impact of these factors on the studied phenomena may need to be carefully evaluated. Finite chaotic systems are highly sensitive to parameter values and initial conditions. Different parameter regimes or initial conditions can lead to substantially different behaviors. Therefore, care must be taken to explore a range of parameter values and initial conditions to ensure the robustness and generality of the findings. This important aspect deserves to be discussed.
In addition, as is well known, fractal wavelet analysis has wide applications in fields such as communication, signal processing, and information security [36,37,38,39,40,41,42]. Chaos theory also has a very rich application in these areas. Therefore, the integration of chaos theory and fractal wavelet analysis to study and solve problems will become a hot frontier problem, and we will explore in this direction.
Author Contributions
Conceptualization, R.L., J.P. and T.L.; validation, R.L., T.L. and Y.L.; formal analysis, R.L., J.P. and T.L.; investigation, R.L., Y.L., J.W. and X.D.; writing original draft, R.L.; writing review and editing, Y.L., J.P. and T.L.; supervision, T.L.; funding acquisition, Y.L. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the Cooperative Education Project of the Ministry of Education (No. 220605115023220), the Natural Science Foundation of Sichuan Province (Nos. 2023NSFSC0070, 2022NSFSC1821), the Scientific Research Project of SUSE (No. 2020RC24), the Ministry of Education Science and Technology Development Center (No. 2020QT13).
Data Availability Statement
Not applicable.
Acknowledgments
Many thanks to experts.
Conflicts of Interest
The authors declare no conflict of interest regarding the publication of this paper.
Sample Availability
Not applicable.
References
- Smítal, J. A chaotic function with some extremal properties. Proc. Am. Math. Soc. 1983, 87, 54–56. [Google Scholar] [CrossRef]
- Chen, E. Chaotic Dynamics on Fractals; University of Science and Technology of China: Hefei, China, 1995. [Google Scholar]
- Xiong, J.C.; Chen, E.C. Chaos caused by a strong-mixing measure-preserving transformation. Sci. China Ser. A 1997, 40, 253–260. [Google Scholar] [CrossRef]
- Li, R.S.; Wang, H.Q.; Zhao, Y. Kato’s chaos in duopoly games. Chaos Solitons Fractals 2016, 84, 69–72. [Google Scholar] [CrossRef]
- Bank, J.; Brooks, J.; Cairns, G.; Davis, G.; Stacey, P. On Devaney’s definition of chaos. Am. Math. Mon. 1992, 99, 332–334. [Google Scholar] [CrossRef]
- Devaney, R. Chaotic Dynamical Systems; Addison-Wesley: New York, NY, USA, 1989. [Google Scholar]
- Ghane, F.; Rezaali, E.; Sarizadeh, A. Sensitivity of iterated function systems. J. Math. Anal. Appl. 2019, 469, 493–503. [Google Scholar] [CrossRef]
- Auslander, J.; Yorke, J.A. Interval maps, factors of maps, and chaos. Tohoku Math. J. 1980, 32, 177–188. [Google Scholar] [CrossRef]
- Glasner, E.; Weiss, B. Sensitive dependence on initial conditions. Nonlinearity 1993, 6, 1067–1075. [Google Scholar] [CrossRef]
- He, L.F.; Yan, X.H.; Wang, L.S. Weak-mixing implies sensitive dependence. J. Math. Anal. Appl. 2004, 299, 300–304. [Google Scholar] [CrossRef][Green Version]
- Li, R.S.; Lu, T.X.; Chen, G.R.; Yang, X.F. Further discussion on Kato’s chaos in set-valued discrete systems. J. Appl. Anal. Comput. 2020, 10, 2491–2505. [Google Scholar] [CrossRef]
- Wu, X.X.; Ding, X.F.; Lu, T.X.; Wang, J.J. Topological dynamics of Zadeh’s extension on upper semi-continuous fuzzy sets. Int. J. Bifurcat. Chaos 2017, 27, 1750165. [Google Scholar] [CrossRef]
- Li, R.S.; Lu, T.X.; Yang, X.F.; Jiang, Y.X. Study on strong sensitivity of systems satisfying the large deviations theorem. Int. J. Bifurcat. Chaos 2021, 31, 2150151. [Google Scholar] [CrossRef]
- Abraham, C.; Biau, G.; Cadre, B. Chaotic properties of mapping on a probability space. J. Math. Anal. Appl. 2002, 266, 420–431. [Google Scholar] [CrossRef][Green Version]
- James, J.; Koberda, T.; Lindsey, K.; Silva, C.; Speh, P. Measurable sensitivity. Proc. Am. Math. Soc. 2008, 136, 3549–3559. [Google Scholar] [CrossRef]
- Xiong, J. Chaos in a topologically transitive system. Sci. China Ser. A 2005, 48, 929–939. [Google Scholar] [CrossRef]
- Huang, W.; Lu, P.; Ye, X.D. Measure-theoretical sensitivity and equicontinuity. Isr. J. Math. 2011, 183, 233–283. [Google Scholar] [CrossRef]
- Cadre, B.; Jacob, P. On pairwise sensitivity. J. Math. Anal. Appl. 2005, 309, 375–382. [Google Scholar] [CrossRef]
- Ruelle, D. Dynamical systems with turbulent behavior. In Mathematical Problems in Theoretical Physics; Lecture Notes in Physics; Springer: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
- Guckenheimer, J. Sensitive dependence to initial conditions for one dimensional maps. Commun. Math. Phys. 1979, 70, 133–160. [Google Scholar] [CrossRef]
- Abraham, C.; Biau, G.; Cadre, B. On Lyapunov exponent and sensitivity. J. Math. Anal. Appl. 2004, 290, 395–404. [Google Scholar] [CrossRef][Green Version]
- Billingsley, P. Convergence of Probability Measures; Wiley: New York, NY, USA, 1968. [Google Scholar]
- Gu, R.B. The large deviations theorem and ergodicity. Chaos Solitons Fractals 2007, 34, 1387–1392. [Google Scholar] [CrossRef]
- Hasselblatt, B.; Katok, A. A First Course in Dynamics; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
- Lardjane, S. On some stochastic properties in Devaney’s chaos. Chaos Solitons Fractals 2006, 28, 668–672. [Google Scholar] [CrossRef]
- Li, T.Y.; Yorke, J. Period 3 implies chaos. Am. Math. Mon. 1975, 82, 985–992. [Google Scholar] [CrossRef]
- Yang, X.F.; Lu, T.X.; Anwar, W. Chaotic properties of a class of coupled mapping lattice induced by fuzzy mapping in non-autonomous discrete systems. Chaos Solitons Fractals 2021, 148, 110949. [Google Scholar]
- Liu, G.; Lu, T.X.; Yang, X.F.; Anwar, W. Further discussion about transitivity and mixing of continuous maps on compact metric spaces. J. Math. Phys. 2020, 61, 112701. [Google Scholar] [CrossRef]
- Zhou, Z.L. Chaos and total chaos. Kexue Tongbao 1988, 33, 1494–1497. [Google Scholar]
- Xiong, J.C. Hausdorff dimension of a chaotic set of shift of symbolic space. Sci. China Ser. A 1995, 25, 1–11. [Google Scholar]
- Walters, P. An Introduction to Ergodic Theory; Springer: New York, NY, USA, 1982. [Google Scholar]
- Li, R.S.; Shi, Y.M. Stronger forms of sensitivity for measure-preserving maps and semiflows on probability spaces. Abstr. Appl. Anal. 2014, 2014, 769523. [Google Scholar] [CrossRef]
- Peterson, K. Ergodic Theory; Cambridge University Press: Cambridge, UK, 1983. [Google Scholar]
- Blanchard, F.; Host, B.; Ruette, S. Asymptotic pairs in positive-entropy systems. Ergod. Theory Dyn. Syst. 2002, 22, 671–686. [Google Scholar] [CrossRef]
- Bowen, R.; Walters, P. Expansive one-parameter flows. J. Differ. Equ. 1972, 12, 180–193. [Google Scholar] [CrossRef]
- Guariglia, E. Fractional calculus of the Lerch zeta function. Mediterr. J. Math. 2022, 19, 109. [Google Scholar] [CrossRef]
- Guido, R.C.; Pedroso, F.; Contreras, R.C.; Rodrigues, L.C.; Guariglia, E.; Neto, J.S. Introducing the discrete path transform (DPT) and its applications in signal analysis, artefact removal, and spoken word recognition. Digit. Signal Process. 2021, 117, 103158. [Google Scholar] [CrossRef]
- Guariglia, E. Primality, fractality and image Analysis. Entropy 2019, 21, 304. [Google Scholar] [PubMed]
- Zheng, X.W.; Tang, Y.Y.; Zhou, J.T. A framework of adaptive multiscale wavelet decomposition for signals on undirected graphs. IEEE Trans. Signal Process. 2019, 67, 1696–1711. [Google Scholar]
- Guariglia, E.; Silvestrov, S. Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on D’(C); Springer: New York, NY, USA, 2016. [Google Scholar]
- Guariglia, E. Harmonic sierpinski gasket and applications. Entropy 2018, 20, 714. [Google Scholar] [PubMed]
- Cattani, C.; Guariglia, E. Fractional derivative of the Hurwitz-function and chaotic decay to zero. J. King Saud Univ. Sci. 2016, 28, 75–81. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).