Next Article in Journal
Optimal Sparse Control Formulation for Reconstruction of Noise-Affected Images
Next Article in Special Issue
Randomly Stopped Minimum, Maximum, Minimum of Sums and Maximum of Sums with Generalized Subexponential Distributions
Previous Article in Journal
Coefficient Bounds for Some Families of Bi-Univalent Functions with Missing Coefficients
Previous Article in Special Issue
A Least Squares Estimator for Gradual Change-Point in Time Series with m-Asymptotically Almost Negatively Associated Errors
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Analysis of Correlation Bounds for Uniformly Expanding Maps on [0, 1]

by
Mohamed Abdelkader
Department of Statistics and Operations Research, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia
Axioms 2023, 12(12), 1072; https://doi.org/10.3390/axioms12121072
Submission received: 4 October 2023 / Revised: 18 November 2023 / Accepted: 21 November 2023 / Published: 23 November 2023
(This article belongs to the Special Issue Probability, Statistics and Estimation)

Abstract

:
In this paper, we provide the decay of correlations for random dynamical systems. Precisely, we consider the uniformly C 2 piecewise expanding maps defined on the unit interval satisfying λ ( T ω ) = inf | T ω | > 2 . As a principal tool of these studies, we use a coupling method for analyzing the coupling time of observables with bounded variation.
MSC:
37A05; 37A30; 60G10; 28D05

1. Introduction

Random dynamical systems (RDSs) are very important and are used to model many phenomena in economics (the evolution of economic processes subject to exogenous shocks [1,2]), in climatology (the modelling of ocean systems and weather [3]), in physics (multi-body celestial mechanics [4]), in biology (gene expression can be modeled using random dynamical systems [5]), etc.
In this current paper, we consider random dynamical systems generated by a finite family { T ω } ω Ω of uniformly C 2 piecewise expanding maps on [ 0 , 1 ] into itself, satisfying the condition λ ( T ω i ) = inf | T ω i | > 2 , where ( Ω , P ) is a probability space.
Our goal is to provide the quenched decay of correlations for our random dynamical systems. Precisely, we want to analyze and estimate the following quantities:
n 0 , L ω n L ω 1 ( ϕ 1 ϕ 2 ) L 1 ( m ) ,
n 0 , | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d ν | ,
n 0 , | g 1 · Q n g 2 d μ g 1 d μ g 2 d μ | ,
where ϕ 1 , ϕ 2 are two probability density functions belonging to the B V space, g 1 B V , g 2 L ( m ) and ν = g 1 m is a measure of probability according to a Lesbuge measure m. The analysis and estimation of quantities in Equations (1)–(3) represent the analysis of the random compositions T ω n : = T θ n 1 ω T θ ω T ω , where θ is a shift map from Ω N into itself given by the following: for all ω ̲ = ( ω 0 , ω 1 , ω 2 , ) Ω N , θ ( ω 0 , ω 1 , ω 2 , ) = ( ω 1 , ω 2 , ) . Our analysis is based on the duality relation between our random dynamical system T ω and the transfer operator L ω given by
ϕ 1 ( ϕ 2 T ω ) d m = ( L ω ϕ 1 ) ϕ 2 d m , ϕ 1 L 1 ( m ) , ϕ 2 L ( m ) ,
and the Lasota–Yorke inequality given by the following: for all n 1 , there exist n 1 , ρ < 1 and a constant C > 0
L n φ ρ φ + C φ L 1 ( m ) , ϕ B
where ( B , . ) is a Banach space. This inequality is very important and used to prove the existence of invariant measures for RDSs (see [6]). Also, we use a practical method called the coupling method. It is easy to use for studying the statistical properties of our random dynamical system. We start with two arbitrary density probabilities belong to the cone
H K = ϕ : [ 0 , 1 ] R + BV , 0 1 ϕ ( x ) d x = 1 , TV ( ϕ ) K ,
and we apply L ω n : = L ω n L ω 1 to ϕ 1 and ϕ 2 . Next, we couple the κ -fractions L ω n ϕ 1 and L ω n ϕ 2 , and these remain bounded by 2 κ . In addition, we continue the coupling and treat ( L ω n ϕ 1 κ ) / ( 1 κ ) and ( L ω n ϕ 2 κ ) / ( 1 κ ) as the initial densities belonging to the cone H K , where K is a positive constant. This method is used to find the statistical properties for random dynamical systems (for more details concerning the coupling method, see [7,8,9]).
In this work, our contribution is providing the upper bounds of the tree quantities in Equations (1)–(3) that are given by the following: for all n 1 ,
L ω n L ω 1 ( ϕ 1 ϕ 2 ) L 1 ( m ) C ( ω ) max ϕ 1 B V , ϕ 2 B V α n , | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d ν | C ( ω ) g 1 B V f B V g α n , | g 1 · Q n g 2 d μ g 1 d μ g 2 d μ | C ( ω ) f B V g α n .
Many scientific papers deal with the statistical properties for random dynamical systems, like the central limit theorem (CLT) [10,11,12,13,14], the almost-sure invariance principle (ASIP) [15], the large deviations principle (LDP) [16], the law of the iterated logarithm (LIL) [17], memory loss (ML) [18] and decay of correlations (DC). For example, Liverani studied the DC for piecewise expanding maps in [19]. Also, Buzzi proved that the DC is an exponential decay for random Lasota–Yorke maps in [20]. In addition, Sulku used the coupling method to prove an explicit correlation bounds for expanding circle maps in [9]. Finally, Stenlund and Sulku analyzed the random circle maps expanding on the average using the coupling method. They proved two statistical properties: (ASIP) and (DC) for the C 2 non-uniformly expanding maps for observables belonging to C α , where α ( 0 , 1 ) .
Our paper is organized as follows. In Section 2, we present our random dynamical system and define mathematical preliminaries like the Markov chain, the skew product, the transfer and the Markov operators. In Section 3, we state our main results. In Section 4, we establish the regularity and take some proprieties of the push-forward densities. In Section 5, we use the coupling argument for analyzing the coupling time. In Section 6, we discuss our results and give some comparisons with other preceding results. In Section 7, we give the proofs of our main results. We finish with some conclusions about our work and some perspectives about future work.

2. Random Dynamical Systems

In this section, we introduce our random dynamical system given by T ω . Then, we define the transfer operator and the Markov operator corresponding to the Markov chain X n . Finally, we finish with the definition of the skew product.
In what follows, the Lebesgue measure on R is denoted by m. On a finite probability space ( Ω , P ) , we consider the following:
  • P = { p ω } ω Ω as a probability vector;
  • { T ω } ω Ω as a finite family of uniformly C 2 piecewise expanding maps T ω : [ 0 , 1 ] [ 0 , 1 ] , such that the derivatives satisfy
    λ ( T ω i ) : = inf x [ 0 , 1 ] | T ω i | > 2 .
The transfer of the operator L ω i into L 1 ( m ) to itself is given by
L ω i g ( x ) = y T ω i 1 { x } g ( y ) | T ω i ( y ) | , g L 1 ( m ) .
Let E be a set defined by
E : = { T ω i : [ 0 , 1 ] [ 0 , 1 ] , s . t . sup | T ω i ( x ) | < } .
We define the following quantities:
A = sup x [ 0 , 1 ] T ω i ( x ) | T ω i ( x ) | 2 + 2 sup I A 0 sup x I | T ω i ( x ) | 1 | I | η ( T ω i ) = 2 λ ( T ω i )
where A 0 is a finite partition of [ 0 , 1 ] ( m o d 0 ) .
Consider
T ω ̲ n = T ( ω ̲ ) = T ( ω 1 , ω 2 , ) = T ω n T ω 1 .
( X n ) n N is the corresponding Markov chain given by
X 0 = d μ , X n + 1 = T ω n + 1 ( X n ) ,
where μ is probability measure on [ 0 , 1 ] and ( ω n ) n is a sequence of i.i.d. random variables with common law P . The Markov operator Q associated to ( X n ) n N is given by
Q f ( x ) = Ω f ( T ω 1 x ) d P ( ω 1 ) , f L ( m ) .
The stationarity property between X n and μ is given by
Q f d μ = f d μ , f L ( m ) .
In this case, the distribution of X n follows the measure μ for all n 0 .
The skew product is a deterministic dynamical system defined by
S : Ω N × [ 0 , 1 ] Ω N × [ 0 , 1 ] ( ω ̲ , x ) ( θ ω ̲ , T ω 1 x )
and related to X n , where the shift map θ is given by
θ : Ω N Ω N ( ω 0 , ω 1 , ω 2 , ) ( ω 1 , ω 2 , )
Observe the relation
S n ( ω ̲ , x ) = ( θ n ω ̲ , T ω ̲ n x ) , for   any   n 0 .
A probability measure μ on [ 0 , 1 ] is stationary if and only if the measure P N μ is invariant under S.
The total variation of f : [ 0 , 1 ] C on an interval [ c , b ] [ 0 , 1 ] is given by
TV ( f ) = sup { i = 0 n | f ( a i + 1 ) f ( a i ) | : n 1 , c = a 0 a n = b } .
The usual L 1 ( m ) norm of g with respect to the Lebesgue measure m is
g 1 = 0 1 | g ( x ) | d m ( x ) .
The function space with bounded variation is
B V : = { f : [ 0 , 1 ] R : g B V < + } , g B V = TV ( g ) + g 1
In the sequel, we may assume one of the following hypotheses:
Hypothesis 1.
For any non-trivial subinterval I [ 0 , 1 ] , there exists n 1 such that T ω ̲ n ( I ) = [ 0 , 1 ] for almost every ω ̲ Ω n .
Hypothesis 2.
T ω i E for all ω i Ω .

3. Main Results

In this section, we state our main results. They result from two theorems. Theorem 1 presents two very important results. In the first part, the . L 1 ( m ) -norm of the difference between L ω n ϕ 1 and L ω n ϕ 2 converges to zero exponentially. In the second part of Theorem 1, the quantity defined in Equation (2) is bounded. Theorem 2 shows that the decay of correlations of quantity in Equation (3) is exponential correlation with respect an arbitrary invariant measure μ .
Theorem 1.
There exists α ( 0 , 1 ) , which the two following properties hold.
(1) 
For almost every ω, there exists C ( ω ) > 0 , and one has
n 0 , L ω n L ω 1 ( ϕ 1 ϕ 2 ) L 1 ( m ) C ( ω ) max ϕ 1 B V , ϕ 2 B V α n ,
where ϕ 1 , ϕ 2 B V are two probability density functions.
(2) 
For a probability measure ν = ϕ m , where ϕ B V , we have
n 0 , | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d ν | C ( ω ) ϕ B V g 1 B V g 2 α n ,
for all complex-valued functions g 1 B V and g 2 L ( m ) .
The next theorem presents the upper bound for quantity Equation (2) when we consider an arbitrary invariant measure μ with density function ϕ B V .
Theorem 2.
There exist two constants α ( 0 , 1 ) and C > 0 such that
n 0 , | g 1 · Q n g 2 d μ g 1 d μ g 2 d μ | C ( ω ) g 1 B V g 2 α n ,
for all g 2 L ( m ) and complex-valued functions g 1 B V .
Remark 1.
We have the following remarks:
1. 
The bound in Equation (4) states that the L 1 -norm ( . L 1 ( m ) ) between, for special sequences ω, the push-forwards (i.e., L ω n ϕ 1 and L ω n ϕ 2 ) of two densities with bounded variation ϕ 1 and ϕ 2 converges to zero exponentially.
2. 
When an arbitrary probability measure ν = ϕ m , where ϕ belongs to the BV space, g 1 and g 2 T ω n become asymptotically uncorrelated at an exponential rate.
3. 
From Equation (6), when μ is an invariant measure, then g 1 and Q n g 2 are exponentially correlated and
g 1 · Q n g 2 d μ c o n v e r g e s   t o g 1 d μ g 2 d μ .
We use the coupling method to give the proof of Theorems 1 and 2. This method is presented in Section 5.

4. Regularity of Densities

In this section, we state very important results. The first result is concerning some properties of the density function under the covering property of our random system. Furthermore, we use the Lasota–Yorke inequality to study the total variation in the push-forward density. For ( ω 0 , , ω n 1 ) Ω n , we denote by [ ω 0 , , ω n 1 ] the cylinder
{ ω ̲ Ω N : ω i = ω i , i = 0 , , n 1 } .
Given that K > 0 will be chosen later, we consider a finite partition U = { I 1 , , I k } of [ 0 , 1 ] in intervals of lengths less than 1 / ( 2 K ) . Point (1) in the next result is Lemma 1.
Since the system has a random covering property, i.e., it satisfies ( H 1 ) , then
i { 1 , , k } , n i 1 , and ω ( i ) Ω n i , such that T ω ( i ) n i I i = [ 0 , 1 ] .
In the next lemma, we study the properties of a probability density function ϕ that belongs to the cone H k under the property of covering systems.
Lemma 1.
For K > 0 , let H K be the cone
H K = ϕ : [ 0 , 1 ] R + BV , 0 1 ϕ ( x ) d x = 1 , TV ( ϕ ) K .
For ϕ H K , there exists κ > 0 and i { 1 , , k } , I i [ 0 , 1 ] , such that
1. 
inf x I i ϕ ( x ) 1 / 2 ;
2. 
inf L ω n ϕ κ , for any n n i and any ω [ ω ( i ) ] .
Proof. 
Suppose that T ω verifies the covering property, i.e., T ω n 0 ( ω ) I ϕ = [ 0 , 1 ] . Then, there exists y I ϕ such that T ω n 0 ( ω ) ( y ) = x . Thus,
L ω n 0 ( ω ) ( 1 I ϕ ) ( x ) 1 I ϕ ( y ) · 1 | ( T ω n 0 ( ω ) ) ( y ) | 1 | ( T ω n 0 ( ω ) ) ( y ) | .
It is enough to take κ = inf y I ϕ | ( T n 0 ( ω ) ) ( y ) | 1 . Using Lemma 1, we see that since ϕ 0 , then for all I ϕ I ,
L ω n 0 ( ω ) ( ϕ ) L ω n 0 ( ω ) ( 1 I ϕ ϕ ) L ω n 0 ( ω ) ( 1 2 1 I ϕ ) = 1 2 L ω n 0 ( ω ) ( 1 I ϕ ) κ 2 .
In the next Lemma we use the Lasota–Yorke inequality to bound the total variation of the push-forward density L ω n ϕ .
Lemma 2.
For all n 1 , there exists η ( 0 , 1 ) , such that the following holds: for every function ϕ with bounded variation, where B > 0 ,
TV ( L ω n ϕ ) η n TV ( ϕ ) + B .
Proof. 
Through the Lasota–Yorke inequality [6], there exists A ( T ω ) > 0 , and one has
TV ( L ω ϕ ) 2 λ ( T ω ) TV ( ϕ ) + A ( T ω ) ϕ L m 1 .
Thus,
TV ( L ω n ϕ ) 2 λ ( T ω n ) TV ( L ω n 1 ϕ ) + A ( T ω n ) L ω n 1 ϕ L m 1 .
For p { 1 , , n } , we have
L ω p ϕ L m 1 ϕ L m 1 ,
and by induction, we have
TV ( L ω n ϕ ) 2 λ ( T ω n ) TV ( L ω n 1 ϕ ) + A ( T ω n ) ϕ L m 1 2 n i = 1 n λ ( T ω i ) TV ( ϕ ) + 1 + 2 λ ( T ω n ) + + 2 n 1 i = 2 n λ ( T ω i ) A ϕ L m 1 η n TV ( ϕ ) + 1 + η + η 2 + + η n 1 A ϕ L m 1 η n TV ( ϕ ) + B ,
with n 0 N such that λ ( T ω n 0 ) = inf λ ( T ω 1 ) , , λ ( T ω n ) and η = 2 / λ ( T ω n 0 ) . □
Remark 2.
Equation (7) plays an important role in the regularity of the push-forward density.
In the next corollary, we present a useful result concerning the regularity of densities that belong to the cone H K . Precisely, if we take ϕ , an arbitrary density function belonging to the cone H K , and apply L ω n , then the density function L ω n ϕ belongs to H K .
Corollary 1.
Assume the conditions of Lemma 2. Let κ ( 0 , 1 ) , K > B / ( 1 κ ) and K : = K / ( 1 κ ) . Then, there exists n κ > 0 such that
L ω n ( H K ) H K , for all n n κ and all ω Ω N .
Proof. 
The set H K enjoys the following simple property. If ϕ H K , and if ϕ κ and κ ( 0 , 1 ) , then
TV ϕ κ 1 κ : = sup { i = 0 n | ϕ ˜ ( a i + 1 ) ϕ ˜ ( a i ) | } = 1 1 κ TV ( ϕ ) K 1 κ ,
which shows that
ϕ ˜ : = ϕ κ 1 κ H K .
Using (8), then there exists n κ > 0 such that
L ω n κ ϕ ˜ : = 1 1 κ L ω n κ ( ϕ κ ) L ω n κ ( H K ) ,
Using Lemma 2, we obtain
TV ( L ω n κ ϕ ˜ ) = TV ( 1 1 κ L ω n κ ( ϕ κ ) ) = 1 1 κ TV ( L ω n κ ϕ ) 1 1 κ η n κ TV ( ϕ ) + B η n κ K + B 1 κ .
If K > B 1 κ , then there exists a large enough constant n > n κ > 0 such that
K > B 1 κ TV ( L ω n ϕ ) TV ( L ω n κ ϕ )
Finally, this concludes that there exists a large enough constant n > n κ > 0 such that
L ω n ϕ H K , i f K > B 1 κ .

5. Coupling Method

In this section, we introduce the coupling method (for more details, see [7,8,9]). It plays an important role to find the statistical properties for random dynamical systems.
We start with two arbitrary probability density functions, ϕ 1 , ϕ 2 H K , for some K > 0 , and we couple a κ -fraction with its n-step push-forwards ϕ j , n = L ω n ϕ j , for a large enough n, so that these push-forwards belong to H K and remain bounded from below by 2 κ . For such n, we can write
ϕ j , n = κ + ( 1 κ ) ϕ ˜ n j , where ϕ ˜ n j = ϕ j , n κ 1 κ H K .
By (8), it follows that
ϕ 1 , n ϕ 2 , n L 1 ( m ) ( 1 κ ) ϕ ˜ n 1 ϕ ˜ n 2 L 1 ( m ) .
We can then continue the procedure inductively, treating ϕ ˜ n j as the initial densities, both belonging to H K . In view of the above, to obtain densities in H K that are bounded from below by 2 κ , we first have to wait n K steps in order to enter the cone H K , and then, according to point (2) in Lemma 1, wait a sufficient number of steps to experience all the finite words ω ( i ) , i = 1 , , k in the sequence θ n K ω . This leads us to define, for i = 1 , , k , the random times
R i ( ω ) = inf { n 0 : θ n ω [ ω ( i ) ] } , R = max i = 1 , , k R i .
We then define
τ 0 ( ω ) = 0 , n 0 ( ω ) = 0 , τ 1 ( ω ) = n K + R ( θ n K ω ) + , n 1 ( ω ) = τ 1 ( ω ) ,
and, for k 2 ,
τ k ( ω ) = n κ + R ( θ n k 1 ( ω ) ω ) + , n k ( ω ) = n k 1 ( ω ) + τ k ( ω ) ,
where = max i = 1 , , k | ω ( i ) | is the maximal length of the words ω ( i ) , i = 1 , , k . Thus, n k is the time at which the k-th coupling will occur, and τ k is the k-th inter-coupling time. Both depend on K and ω , but we suppress this from the notation for readability. Via the coupling argument, we obtain that for all n 0 and all pairs ϕ 1 , ϕ 2 H K , it holds that
ϕ 1 , n ϕ 2 , n L m 1 2 ( 1 κ ) N n ,
where N n is the coupling number that has occurred at time n, defined by
N n ( ω ) = max { k 0 : n k ( ω ) n } .
To prove the exponential decay of correlations, we now need to show that N n grows at least linearly with n, for almost every ω . The following lemma gives us some needed properties of the random time R:
Lemma 3.
There exists a constant 0 < q < 1 such that P ˜ ( R > n ) = O ( q n ) .
Proof. 
It is enough to prove that P ˜ ( R i > n ) decays exponentially fast for each i separately. In other words, we want to prove that, for the full-shift θ on Ω N on a finite alphabet Ω , endowed with a Bernoulli product measure μ associated to a probability vector p = { p ω } ω Ω , the hitting time T to any cylinder [ ω ] = [ ω 0 , , ω j 1 ] has exponential tails: μ ( T > n ) = O ( q n ) for some q < 1 .
(1) We first reduce this problem in order to consider only cylinders of length 1. For this, we consider the new alphabet Ω ^ = Ω j , and identify the full shift on Ω N to a subshift on ( Ω j ) N , via the map ( ω n ) n 0 ( ( ω n , , ω n + j 1 ) ) n 0 . The image of this map is the subshift of finite type on Ω ^ N , whose transition matrix A satisfies A ( ω 0 ω j 1 ) , ( ω 0 ω j 1 ) = 1 if and only if ω 1 = ω 0 , , ω j 1 = ω j 2 .
The Bernoulli measure μ is then identified with the Markov measure ν on Ω ^ N associated to the stochastic matrix P defined by P ( ω 0 ω j 1 ) , ( ω 1 ω j ) = p ω j and the invariant probability vector p ^ defined by p ^ ( ω 0 ω j 1 ) = p ω 0 p ω j 1 . It is important to check that A and P are irreducible and aperiodic. The hitting time T ^ on Ω ^ N to the cylinder [ ω 0 ω j 1 ] of length 1 satisfies ν ( T ^ > n ) = μ ( T > n ) .
(2) Then, the problem is reduced to prove that, for a subshift of finite type with finite alphabet Ω ^ with transition matrix A, endowed with a Markov measure ν associated to a primitive stochastic matrix P and an invariant probability vector p ^ , the hitting time T ^ to any cylinder [ ω ] of length 1 has an exponential tail: ν ( T ^ > n ) = O ( q n ) for some q < 1 . The rest of the proof is now devoted to proving this fact, and will not mention of the particular nature of the new alphabet Ω ^ .
(3) n 0 , one has
ν ( T ^ = n ) = ν ω 0 , , ω n 1 Ω ^ { ω } [ ω 0 , , ω n 1 , ω ] = ω 0 , , ω n 1 ω p ^ ω 0 P ω 0 , ω 1 P ω n 1 , ω .
Introducing the new matrix Q defined by
Q ω , ω = P ω , ω if ω ω , 0 otherwise ,
we can write
ν ( T ^ = n ) = ω 0 , , ω n 1 Ω ^ p ^ ω 0 Q ω 0 , ω 1 Q ω n 1 , ω = ω 0 p ^ ω 0 Q ω 0 , ω n .
Since P is stochastic and primitive, 0 Q P and Q P , via the Perron–Frobenius theory for positive matrices (see item (e) of Theorem 1.1 in [21]), we have that the spectral radius of Q is strictly less than 1. Consequently, all the entries Q ω , ω n decay exponentially fast with n, from which it follows that ν ( T ^ > n ) = m > n ν ( T ^ = m ) converges to 0 exponentially fast. □
Note that we can prove the exponential decay of quenched and annealed correlations exactly as in [8].

6. Discussion

In this section, we discuss our main results. We use the coupling method to find statistical properties of our RDS that consists of coupling the push-forwards densities. For this, we start with two probability density functions ϕ 1 , ϕ 2 belonging to the cone H K defined by
H K = ϕ : [ 0 , 1 ] R + BV , 0 1 ϕ ( x ) d x = 1 , TV ( ϕ ) K .
for some K > 0 , we couple a κ -fraction ϕ j , n = L ω n ϕ j = κ + ( 1 κ ) ϕ ˜ n j , where
ϕ ˜ n j = ϕ j , n κ 1 κ H K .
For a large enough n, using Lemma 2, we prove that L ω n ϕ j belongs to H K and remains bounded from below by 2 κ . That means the the cone H K is included in the cone H K . We continue the coupling procedure and we analyze the random time defined by
R i ( ω ) = inf { n 0 : θ n ω [ ω ( i ) ] } , R = max i = 1 , , k R i .
Then, there exists a constant 0 < q < 1 such that P ˜ ( R > n ) = O ( q n ) . The last probability leads us to obtain an exponential decay of quenched and annealed correlations exactly as in [8].
Furthermore, Inequality (4) in Theorem 1 shows that the difference between two push-forward densities L ω n ϕ 1 and L ω n ϕ 2 converges to 0 exponentially. Moreover, Inequality (5) in Theorem 1 shows that when ν = ϕ m , a measure of probability where ϕ is a probability density function belonging to the BV space, then the bound of the quantity in (2) is bounded by C ( ω ) ϕ B V g 1 B V g 2 α n and g 1 and g 2 T ω n are asymptotically uncorrelated. Finally, Inequality (6) shows that g 1 and Q n g 2 are exponentially correlated and
g 1 · Q n g 2 d μ converges to g 1 d μ g 2 d μ ,
when μ is an invariant measure.

7. Proofs of Theorems

In this section, we prove our main results presented in Section 3. For this, we need to introduce the following technical lemma. It leads to a bound limit of the total variation between two BV observables.
Lemma 4.
For all observable ϕ and ψ B V , we have
TV ( ϕ ψ ) ϕ B V ψ B V .
Proof. 
For all observable ϕ and ψ B V , we have
TV ( ϕ ψ ) = sup { i = 0 n | ( ϕ ψ ) ( a i + 1 ) ( ϕ ψ ) ( a i ) | , 0 = a 0 < < a n = 1 } = sup { i = 0 n | ϕ ( a i + 1 ) ψ ( a i + 1 ) ϕ ( a i ) ψ ( a i ) | , 0 = a 0 < < a n = 1 } = sup { i = 0 n | ϕ ( a i + 1 ) ψ ( a i + 1 ) ϕ ( a i + 1 ) ψ ( a i ) + ϕ ( a i + 1 ) ψ ( a i ) ϕ ( a i ) ψ ( a i ) | , 0 = a 0 < < a n = 1 } sup { i = 0 n | ϕ ( a i + 1 ) | | ψ ( a i + 1 ) ψ ( a i ) | , 0 = a 0 < < a n = 1 } + sup { i = 0 n | ψ ( a i + 1 ) | | ϕ ( a i + 1 ) ϕ ( a i ) | , 0 = a 0 < < a n = 1 } ϕ 1 TV ( ψ ) + ψ 1 V a r ( ϕ ) ϕ 1 TV ( ψ ) + ψ 1 TV ( ϕ ) + V a r ( ϕ ) TV ( ψ ) + ϕ 1 ψ 1 = ϕ B V ψ B V .
Proof of Theorem 1.
Given two sequences of p.d.f.s ϕ 1 , n , ϕ 2 , n H K , we have
ϕ 1 , n ϕ 2 , n L 1 ( m ) { n ˜ > n } | ϕ 1 , n ϕ 2 , n | d m A + { n ˜ n } | ϕ 1 , n ϕ 2 , n | d m B .
Using Inequality (10) and
L ω n 1 = 1.1 T ω n T ω 1 1 L n ϕ ϕ ,
we obtain
A ϕ 1 , n + ϕ 2 , n P ( { n ˜ > n } ) C max ( ϕ 1 B V , ϕ 2 B V ) q n ,
and
B 2 ( 1 κ ) t n 1 .
Finally, the first result of Theorem 1 is verified with α = max ( ( 1 κ ) t , q ) . Let us denote
χ ( n ) = 1 { n n ˜ } + ( 1 κ ) t n 1 .
Define a perturbed probability density function ψ r by
ϕ g = ϕ + r 1 + r , r > 0 .
Since ϕ + r r , we obtain
TV ( ϕ r ) = 1 1 + r TV ( ϕ ) < 1 r TV ( ϕ ) .
Thus,
ϕ r H 1 1 r TV ( ϕ ) < 1 TV ( ϕ ) < r .
Using (9), we have
ϕ 1 , n ϕ 2 , n L 1 ( m ) 2 ( 1 k ) [ t n ] + 2 q N n 2 ( 1 k ) t n 1 .
Consider a complex function g 2 L ( m ) and a real function g 1 B V with g 1 d m = 0 . Define
g 1 ˜ = g 1 + 2 TV ( g 1 ) 2 TV ( g 1 ) .
It is clear that g 1 ˜ H 1 . Therefore,
| g 1 · g 2 T ω n d m | = | L ω n g 1 · g 2 d m | g 2 L ω n g 1 L 1 ( m ) 2 TV ( g 1 ) g 2 L ω n ( g 1 ˜ 1 ) L 1 ( m ) 4 TV ( g 1 ) g 2 χ ( n ) .
In general, since g 1 d m = 0 , we obtain the following inequality:
| g 1 · g 2 T ω n d m g 1 d m g 2 T ω n d m | 4 TV ( g 1 ) g 2 χ ( n ) .
Define
H = g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d m ,
and
G = g 2 T ω n d ν g 2 T ω n d m .
Now, if we replace d m by d ν = ϕ d m , where ϕ is a density probability in BV, and use Lemma 4, we obtain
| H | = | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d m | = | g 1 · g 2 T ω n ϕ d m g 1 ϕ d m g 2 T ω n d m | 4 g 1 ϕ B V g 2 χ ( n ) 4 ϕ B V g 1 B V g 2 χ ( n ) .
and
| G | = | g 2 T ω n d ν g 2 T ω n d m | = | ϕ g 2 T ω d m ϕ d m ϕ g 2 T ω n d m | 4 TV ( ϕ ) g 2 χ ( n ) 4 ϕ B V g 2 χ ( n ) .
Using Inequalities (12) and (13), we obtain
| V | = | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d ν | = | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d m | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d m | + | g 1 d ν g 2 T ω n d ν g 1 d ν g 2 T ω n d m | | H | + | g 1 d ν | | G | | H | + g 1 B V | G | 8 ϕ B V g 1 B V g 2 χ ( n ) .
Then, the proof of Inequality (5) is finished for real-valued g 1 . Through similarity, we prove the same bound for the g 1 complex function. □
Proof of Theorem 2.
We take μ = ν . Since g 1 and g 2 are bounded, we obtain
Z = | g 1 · Q n g 2 d μ g 1 d μ g 2 d μ | = | g 1 · Q n g 2 d μ g 1 d μ Q n g 2 d μ | = | g 1 · E [ g 2 T ω n ] d μ g 1 d μ E [ g 2 T ω n ] d μ | E | g 1 · g 2 T ω n d μ g 1 d μ g 2 T ω n d μ | E 8 ψ B V g 1 B V g 2 χ ( n ) C ψ B V g 1 B V g 2 E [ χ ( n ) ] C ψ B V g 1 B V g 2 D q n + ( 1 k ) t n 1 .

8. Conclusions and Perspectives

In the present paper, we prove that the decay of correlations for C 2 piecewise expanding maps from [ 0 , 1 ] into itself is an exponential decay of correlations. For this, we apply the Lasota–Yorke inequality (see Lemma 2) for our random dynamical systems. This inequality leads to the existence of an absolutely continuous invariant measure ν = ψ m , where ψ B V . Then, we use a very useful method called the coupling method. Firstly, this method consists of starting with two arbitrary probability density functions ψ 1 and ψ 2 belonging to the cone H K , where K is a positive constant. Secondly, we couple the κ -fraction with its n-steps L ω n ϕ 1 and L ω n ϕ 2 belonging to the cone H K , and this remains bounded by 2 κ . Finally, we continue the procedure of coupling and treat the initial densities ϕ ˜ n 1 and ϕ ˜ n 2 , both belonging to H K , to obtain densities in H K that are bounded from below by 2 κ . For this step, we wait n K steps in order to enter the cone H K , and then, according to point (2) in Lemma 1, we wait a sufficient number of steps to experience all the finite words ω ( i ) , i = 1 , , k , in the sequence θ n K ω . In addition, using the coupling argument, we obtain that for all n 0 and all pairs ϕ 1 , ϕ 2 H K , it holds that
ϕ 1 , n ϕ 2 , n L m 1 2 ( 1 κ ) N n ,
where N n is defined in Equation (11). Furthermore, the analysis of N n leads us to prove the decay of correlations for our random dynamical systems. The first result about the decay of correlations is given by the following inequality: there exists 0 < α < 1 such that for almost every ω , there exists C ( ω ) > 0
n 0 , L ω n L ω 1 ( ϕ 1 ϕ 2 ) L 1 ( m ) C ( ω ) max ϕ 1 B V , ϕ 2 B V α n ,
where ϕ 1 and ϕ 2 two probability density functions belonging to the B V space. For the second result, given a probability distribution d ν = ϕ d m , ϕ B V , there exists 0 < α < 1 such that for almost every ω , there exists C ( ω ) > 0
n 0 , | g 1 · g 2 T ω n d ν g 1 d ν g 2 T ω n d ν | C ( ω ) ψ B V f B V g α n ,
for all complex-valued functions g 1 B V et g L ( m ) . The third result is given by the following: there exist two constants, α ( 0 , 1 ) and C > 0 , such that
n 0 , | g 1 · Q n g 2 d μ g 1 d μ g 2 d μ | C g 1 B V g 2 α n ,
where g 2 L ( m ) and g 1 B V are complex-valued functions.
In the future, we will work to prove other statistical properties for our random dynamical systems like the central limit theorem, the loss memory and the almost-sure invariance principle using the coupling method.

Funding

This research is funded by “Researchers Supporting Project number (RSPD2023R1068), King Saud University, Riyadh, Saudi Arabia”.

Institutional Review Board Statement

This study did not require ethical approval.

Data Availability Statement

No data were used to support this study.

Acknowledgments

The author extends him appreciation to King Saud University in Riyadh, Saudi Arabia for funding this research work through Researchers Supporting Project number (RSPD2023R1068). The author would like to thank Romain Aimino for several useful discussions in this paper and for suggesting Section 5.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Majumdar, M. Probability and Partial Differential Equations in Modern Applied Mathematics; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2010. [Google Scholar] [CrossRef]
  2. Akhmet, M.; Akhmetova, Z.; Fen, M.O. Chaos in economic models with exogenous shocks. J. Econ. Behav. Organ. 2014, 106, 95–108. [Google Scholar] [CrossRef]
  3. Ghil, M.; Sciamarella, D. Review Article: Dynamical Systems, Algebraic Topology, and the Climate Sciences. Nonlinear Process. Geophys. 2023, 30, 399–434. [Google Scholar] [CrossRef]
  4. Holmes, P. Poincaré, celestial mechanics, dynamical-systems theory and ‘chaos’. Phys. Rep. 1990, 193, 137–163. [Google Scholar] [CrossRef]
  5. Antoneli, F.; Ferreira, R.C.; Briones, M.R.S. A model of gene expression based on random dynamical systems reveals modularity properties of gene regulatory networks. Math. Biosci. 2016, 276, 82–100. [Google Scholar] [CrossRef] [PubMed]
  6. Lasota, A.; Yorke, J.A. On the existence of invariant measures for piecewise monotonic transformation. Trans. Am. Math. Soc. 1973, 186, 481–488. [Google Scholar] [CrossRef]
  7. Bressaud, X.; Liverani, C. Anosov diffeomorphisms and coupling. Ergod. Theory Dyn. Syst. 2022, 22, 129–152. [Google Scholar] [CrossRef]
  8. Stenlund, M.; Sulku, H. A coupling approach to random circle maps expanding on the average. Stoch. Dyn. 2014, 14, 29. [Google Scholar] [CrossRef]
  9. Sulku, H. Explicit correlation bounds for expanding circle maps using the coupling method. arXiv 2013, arXiv:1211.2438v2. [Google Scholar]
  10. Abdelkader, M.; Aimino, R. On the quenched central limit theorem for random dynamical systems. J. Phys. A Math. Theor. 2016, 49, 244002. [Google Scholar] [CrossRef]
  11. Aimino, R.; Nicol, M.; Vaienti, S. Annealed and quenched limit theorems for random expanding dynamical systems. Probab. Theory Relat. Fields 2015, 162, 233–274. [Google Scholar] [CrossRef]
  12. Ayyer, A.; Liverani, C.; Stenlund, M. Quenched CLT for randomtoral automorphism. Discret. Contin. Dyn. Syst. 2009, 24, 331–348. [Google Scholar] [CrossRef]
  13. Wael, B.; Christopher, B. Mixing rates and limit theorems for random intermittent maps. Nonlinearity 2016, 29, 1417–1433. [Google Scholar]
  14. Conze, J.P.; Raugi, A. Limit theorems for sequential expanding dynamical systems on [0, 1]. Contemp. Math. Am. Math. Soc. 2007, 430, 89–121. [Google Scholar]
  15. Philipp, W.; Stout, W. Almost sure invariance principles for partial sums of weakly dependent random variables. Mem. Am. Math. Soc. 1975, 2, 140. [Google Scholar] [CrossRef]
  16. Alves, J.F.; Freitas, J.M.; Luzzato, S.; Vaienti, S. From rates of mixing to recurrence times via large deviations. Adv. Math. 2011, 228, 1203–1236. [Google Scholar] [CrossRef]
  17. Dragičević, D.; Froyland, G.; Gonzalez-Tokman, C.; Vaienti, S. A spectral approach for quenched limit theorems for random expanding dynamical systems. Commun. Math. Phys. 2018, 360, 1121–1187. [Google Scholar] [CrossRef]
  18. Ott, W.; Stenlund, M.; Young, L.S. Memory loss for time-dependent dynamical systems. Math. Res. Lett. 2009, 16, 463–475. [Google Scholar] [CrossRef]
  19. Liverani, C. Decay of correlations for piecewise expanding maps. J. Stat. Phys. 1995, 78, 1111–1129. [Google Scholar] [CrossRef]
  20. Buzzi, J. Exonential decay of correlations for random Lasota-Yorke maps. Commun. Math. Phys. 1999, 208, 25–54. [Google Scholar] [CrossRef]
  21. Seneta, E. Non-Negative Matrices and Markov Chains; Springer Series in Statistics; Springer Science: Berlin/Heidelberg, Germany, 2006. [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.

Share and Cite

MDPI and ACS Style

Abdelkader, M. Analysis of Correlation Bounds for Uniformly Expanding Maps on [0, 1]. Axioms 2023, 12, 1072. https://doi.org/10.3390/axioms12121072

AMA Style

Abdelkader M. Analysis of Correlation Bounds for Uniformly Expanding Maps on [0, 1]. Axioms. 2023; 12(12):1072. https://doi.org/10.3390/axioms12121072

Chicago/Turabian Style

Abdelkader, Mohamed. 2023. "Analysis of Correlation Bounds for Uniformly Expanding Maps on [0, 1]" Axioms 12, no. 12: 1072. https://doi.org/10.3390/axioms12121072

APA Style

Abdelkader, M. (2023). Analysis of Correlation Bounds for Uniformly Expanding Maps on [0, 1]. Axioms, 12(12), 1072. https://doi.org/10.3390/axioms12121072

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop