Next Article in Journal
The Effects of the Introduction of Volume-Based Liquidity Constraints in Portfolio Optimization with Alternative Investments
Previous Article in Journal
A Computational Model of the Secondary Hemostasis Pathway in Reaction Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Research on Stability and Bifurcation for Two-Dimensional Two-Parameter Squared Discrete Dynamical Systems

College of Applied Mathematics, Jilin University of Finance and Economics, Changchun 130117, China
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(15), 2423; https://doi.org/10.3390/math12152423
Submission received: 10 June 2024 / Revised: 31 July 2024 / Accepted: 1 August 2024 / Published: 4 August 2024

Abstract

:
This study investigates a class of two-dimensional, two-parameter squared discrete dynamical systems. It determines the conditions for local stability at the fixed points for these proposed systems. Theoretical and numerical analyses are conducted to examine the bifurcation behavior of the proposed systems. Conditions for the existence of Naimark–Sacker bifurcation, transcritical bifurcation, and flip bifurcation are derived using center manifold theorem and bifurcation theory. Results of the theoretical analyses are validated by numerical simulation studies. Numerical simulations also reveal the complex bifurcation behaviors exhibited by the proposed systems and their advantage in image encryption.

1. Introduction

The bifurcation behavior observed in discrete dynamic systems is fundamentally a nonlinear phenomenon. Bifurcation is relevant across a wide range of fields, including physics, control systems, biology, economics, and chemistry [1,2,3,4]. Numerous real-world phenomena, such as noise generation, aircraft crashes resulting from abrupt wing flapping, predator–prey dynamics in ecology, stock market fluctuations, and the transition of cardiac rhythms from normal beating to fibrillation, can be attributed to bifurcations [5]. Thus, the study of bifurcation in discrete dynamic systems holds substantial theoretical and practical significance.
In recent decades, the bifurcation of discrete dynamic systems has emerged as a prominent area of research among scholars. Initial investigations primarily concentrated on one-dimensional discrete dynamic systems, with logical mapping emerging as the most widely studied example [6]. Despite its simplicity as a mathematical model, this one-dimensional logical mapping exhibits remarkably complex dynamics. Building upon the foundational principles of logical mapping, researchers have subsequently developed new discrete dynamic systems characterized by a diverse array of dynamic behaviors. These behaviors have been found to have practical applications in various fields, including traffic control, cryptography, and image encryption [7]. For instance, reference [8] presented an innovative image encryption method based on logical mapping, while reference [9] proposed a novel model of one-dimensional delay linear coupling logical mapping specifically designed for color image encryption, which demonstrated impressive encryption performance. Moreover, reference [10] introduced a new K-map grounded in logical mapping, which displayed intricate bifurcation and chaotic dynamics, thereby rendering it suitable for applications in traffic control, cryptography, and other related domains.
While one-dimensional discrete dynamic systems exhibit the advantages of a simple structure and ease of implementation, they are characterized by limited sensitivity [11]. In contrast, two-dimensional and higher-dimensional systems better replicate natural conditions compared to their one-dimensional counterparts [12]. By employing central manifold theory, the analysis of high-dimensional systems can be effectively reduced to the analysis of two-dimensional systems [13]. Consequently, a significant body of research has emerged from scholars focusing on the dynamics of two-dimensional discrete dynamic systems. Henon mapping is a two-dimensional dynamical system characterized by a quadratic term, which is notably simplistic in its formulation yet exhibits rich and diverse dynamic behavior [14]. Numerous two-dimensional discrete systems have been developed based on the framework of Henon mapping. For example, reference [15] explored the application of discrete amnesia to Hénon mapping, resulting in an enhanced version characterized by improved chaos and complexity. This adaptation significantly bolsters the performance of the original Hénon mapping and shows promising prospects for practical applications. Reference [16] posited that the improved Hénon mapping can enhance the security of color image encryption algorithms. Additionally, reference [17] introduced a new discrete simplified Lorentz map, also incorporating a quadratic term, which elucidates the occurrence of bifurcations and chaotic behavior while simultaneously mitigating the complexities associated with the traditional Lorentz map. Collectively, these studies underscore the intricate dynamic behaviors inherent in discrete dynamical systems featuring quadratic terms.
The existing literature indicates that a novel type of discrete dynamic system can be developed through the deformation and coupling of two one-dimensional discrete dynamic systems [18]. Reference [19] explored the bifurcation behavior associated with fixed points in linear coupled logical systems. Reference [20] presented a two-dimensional noninvertible mapping that integrates linear mapping with a nonlinear cubic term. The authors derive the conditions for the existence of various bifurcations, including pitchfork bifurcation, flip bifurcation, and Naimark–Sacker bifurcation, utilizing the central manifold theorem alongside bifurcation theory in [20]. Reference [21] constructed two-dimensional parabolic discrete mapping through the nonlinear coupling of one-dimensional logical mapping and square mapping. Furthermore, reference [22] investigated the coupling system of two logical mappings. Collectively, these findings demonstrate that nonlinear coupling mapping significantly alters the dynamic characteristics of discrete systems, leading to the emergence of nonlinear physical phenomena such as bifurcations [23]. Building upon the advantages of logical mapping and discrete mapping that includes square terms, this paper proposes a two-dimensional, two-parameter discrete dynamic system characterized by a square term. The dynamic behavior of this proposed system is analyzed both theoretically and numerically.
This paper is organized as follows. In Section 2, a class of two-dimensional two-parameter squared discrete dynamical systems are constructed, and the fixed points for these proposed systems are computed. Subsequently, the stability of the fixed points is analyzed, and the local stability conditions at these points are discussed. In Section 3, theoretical analysis is conducted on the bifurcation behaviors of the proposed systems. The conditions for the existence of Naimark–Sacker bifurcations, transcritical bifurcations, and flip bifurcations are obtained. In Section 4, the numerical simulations are carried out. The numerical analysis is used to verify the validity of the theoretical analysis. In Section 5, the main conclusions of the work are summarized.

2. Existence and Stability of Fixed Points

In this paper, we consider a class of two-dimensional two-parameter squared discrete dynamical systems, which take the form
F : x a x + 3 2 y y b ( x x 2 )
where a 0 , b 0 .

2.1. Existence of Fixed Points

Let P x 0 , y 0 be the fixed point of the two-dimensional two-parameter squared discrete dynamical system (1); then, the point satisfies the equation
x 0 = a x 0 + 3 2 y 0 y 0 = b x 0 x 0 2
and the Jacobi matrix of the discrete dynamical system (1) at the fixed point P x 0 , y 0 is
D F ( x 0 , y 0 ) = a 3 2 b 2 b x 0 0
Its characteristic equation is λ 2 a λ + 3 b x 0 3 2 b = 0 .
By a simple calculation, we can obtain the following proposition:
Proposition 1.
When x 0 = 0 , the fixed point of the discrete dynamical system (1) is P 1 0 , 0 ; when x 0 0 , the fixed point of the discrete dynamical system (1) is P 2 2 a 3 b + 1 2 3 b , 2 3 1 a 2 a 3 b + 1 2 3 b .

2.2. Stability at the Fixed Point P 1 0 , 0

For investigating the stability at the fixed point P 1 0 , 0 of the discrete dynamical system (1), we calculate the Jacobian matrix at the fixed point P 1 0 , 0 . The Jacobian matrix at the fixed point P 1 0 , 0 is given by D F ( 0 , 0 ) = a 3 2 b 0 . Its characteristic equation is λ 2 a λ 3 2 b = 0 , and the eigenvalues are given by λ 1 = a + a 2 + 6 b 2 and λ 2 = a a 2 + 6 b 2 .
Theorem 1.
For the two-dimensional two-parameter squared discrete dynamical system (1), the stability at the fixed point P 1 0 , 0 is listed as follows:
(1) 
When a 2 + 6 b = 0 :
If a = ± 2 , b = 2 3 , P 1 0 , 0 is a critical node; if 2 < a < 2 , b = a 2 6 , P 1 0 , 0 is a stable node; if a > 2 or a < 2 , b = a 2 6 , P 1 0 , 0 is an unstable node.
(2) 
When a 2 + 6 b < 0 :
If b < 2 3 , P 1 0 , 0 is an unstable focus; if 2 3 < b < 0 , P 1 0 , 0 is a stable focus.
(3) 
When a 2 + 6 b > 0 :
If a > 0 , b > 2 3 1 + a , P 1 0 , 0 is an unstable node; if a > 0 , 2 3 1 a < b < 2 3 1 + a , P 1 0 , 0 is a saddle; if a > 2 , b < 2 3 1 a , P 1 0 , 0 is an unstable node; if 0 < a < 2 , b < 2 3 1 a , P 1 0 , 0 is a stable node.
If a < 0 , b > 2 3 1 a , P 1 0 , 0 is an unstable node; if a < 0 , 2 3 1 + a < b < 2 3 1 a , P 1 0 , 0 is a saddle; if 2 < a < 0 , b < 2 3 1 + a , P 1 0 , 0 is a stable node; if a < 2 , b < 2 3 1 + a , P 1 0 , 0 is an unstable node.
Proof. 
(1) When a 2 + 6 b = 0 , the eigenvalue λ 1 = λ 2 = a 2 . If a 2 = 1 , then a = ± 2 , b = 2 3 , P 1 0 , 0 is a critical node. When 2 < a < 2 , λ 1 = λ 2 = a 2 < 1 , then the fixed point P 1 0 , 0 is a stable node; when a > 2 or a < 2 , λ 1 = λ 2 = a 2 > 1 , then the fixed point P 1 0 , 0 is an unstable node.
(2) When a 2 + 6 b < 0 , eigenvalues λ 1 = a + i a 2 6 b 2 and λ 2 = a i a 2 6 b 2 are two conjugate complex numbers. They are equivalent to λ 1 = 3 2 b e i arctan a 2 6 b a and λ 2 = 3 2 b e i arctan a 2 6 b a . When b = 2 3 , λ 1 = λ 2 = 1 , and a 2 + 6 b < 0 , then 2 < a < 2 . When b < 2 3 , λ 1 = λ 2 > 1 , then the fixed point P 1 0 , 0 is an unstable focus; when 2 3 < b < 0 , λ 1 = λ 2 < 1 , then the fixed point P 1 0 , 0 is a stable focus.
(3) When a 2 + 6 b > 0 , the eigenvalues λ 1 ,   λ 2 are two real numbers. It is obviously λ 1 > λ 2 . A discussion is as follows:
① It is supposed that λ 1 > λ 2 > 1 . Since λ 1 > λ 2 , it only needs to satisfy λ 2 = a a 2 + 6 b 2 > 1 . It is equivalent to b < 2 3 1 a and a 2 > 0 . Thus, if a > 2 and b < 2 3 1 a , the fixed point P 1 0 , 0 is an unstable node.
② It is supposed that λ 2 < λ 1 < 1 . Since λ 1 > λ 2 , it only needs to satisfy λ 1 = a + a 2 + 6 b 2 < 1 . It is equivalent to 2 a > 0 and b < 2 3 1 + a . Thus, if a < 2 and b < 2 3 1 + a , the fixed point P 1 0 , 0 is an unstable node.
③ It is supposed that λ 2 < 1 and λ 1 > 1 . Since a + a 2 + 6 b 2 > 1 and a a 2 + 6 b 2 < 1 , so a 2 + 6 b > 2 a and a 2 + 6 b > 2 + a . It is equivalent to a > 0 , b > 2 3 1 + a and a < 0 , b > 2 3 1 a . Thus, if a > 0 , b > 2 3 1 + a , the fixed point P 1 0 , 0 is an unstable node; if a < 0 , b > 2 3 1 a , the fixed point P 1 0 , 0 is also an unstable node.
④ It is supposed that 1 < λ 2 < λ 1 < 1 . It only needs to satisfy a + a 2 + 6 b 2 < 1 and a a 2 + 6 b 2 > 1 . Under a simple calculation, it is equivalent to 0 < a < 2 , b < 2 3 1 a and 2 < a < 0 , b < 2 3 1 + a . Thus, if 0 < a < 2 , b < 2 3 1 a , the fixed point P 1 0 , 0 is a stable node; if 2 < a < 0 , b < 2 3 1 + a , the fixed point P 1 0 , 0 is also a stable node.
⑤ It is supposed that λ 2 < 1 , 1 < λ 1 < 1 . Since a a 2 + 6 b 2 < 1 and 1 < a + a 2 + 6 b 2 < 1 , a simple calculation can decide a < 0 , 2 3 1 + a < b < 2 3 1 a . Thus, if a < 0 , 2 3 1 + a < b < 2 3 1 a , the fixed point P 1 0 , 0 is a saddle.
⑥ It is supposed that 1 < λ 2 < 1 , λ 1 > 1 . Since 1 < a a 2 + 6 b 2 < 1 and a + a 2 + 6 b 2 > 1 , a simple calculation can decide a > 0 , 2 3 1 a < b < 2 3 1 + a . Thus, if a > 0 , 2 3 1 a < b < 2 3 1 + a , the fixed point P 1 0 , 0 is a saddle. □

2.3. Stability at the Nonzero Fixed Point P 2 2 a 3 b + 1 2 3 b , 2 3 1 a 2 a 3 b + 1 2 3 b

For investigating the stability at the nonzero fixed point of the discrete dynamical system (1), we calculate the Jacobian matrix at the nonzero fixed point P 2 2 a 3 b + 1 2 3 b , 2 3 1 a 2 a 3 b + 1 2 3 b . The Jacobian matrix at the fixed point P 2 2 a 3 b + 1 2 3 b , 2 3 1 a 2 a 3 b + 1 2 3 b is given by
D F 2 a 3 b + 1 2 3 b , 2 3 1 a 2 a 3 b + 1 2 3 b = a 3 2 4 a 3 b + 4 3 0
Its characteristic equation is λ 2 a λ + 2 a + 3 2 b 2 = 0 , and the eigenvalues are given by λ 1 = a + a 2 8 a 6 b + 8 2 and λ 2 = a a 2 8 a 6 b + 8 2 .
Theorem 2.
For the two-dimensional two-parameter squared discrete dynamical system (1), stability at the nonzero fixed point P 2 is listed as follows:
(1) 
When a 2 8 a 6 b + 8 = 0 :
If a = 2 , b = 2 3 , P 2 is a critical node; if a = 2 , b = 14 3 , P 2 is a critical node.
If 2 < a < 2 , b = a 2 8 a + 8 6 , P 2 is a stable node; if a < 2 or a > 2 , b = a 2 8 a + 8 6 , P 2 is an unstable node.
(2) 
When a 2 8 a 6 b + 8 < 0 :
If 4 3 4 a 3 < b < 2 4 a 3 , P 2 is a stable focus; if b > 2 4 a 3 , P 2 is an unstable focus.
(3) 
When a 2 8 a 6 b + 8 > 0 :
If a > 0 , b < 2 3 2 a , P 2 is an unstable node; if a > 0 , 2 3 2 a < b < 2 3 ( 1 a ) , P 2 is a saddle; if 0 < a < 2 , b > 2 3 ( 1 a ) , P 2 is a stable node; if a > 2 , b > 2 3 ( 1 a ) , P 2 is an unstable node.
If a < 0 , b < 2 3 ( 1 a ) , P 2 is an unstable node; if a < 0 , 2 3 ( 1 a ) < b < 2 3 2 a , P 2 is a saddle; if 2 < a < 0 , b > 2 3 2 a , P 2 is a stable node; if a < 2 , b > 2 3 2 a , P 2 is an unstable node.
Proof. 
(1) When a 2 8 a 6 b + 8 = 0 , λ 1 = λ 2 = a 2 . If a = ± 2 , λ 1 = λ 2 = ± 1 , thus P 2 is a critical node. If 2 < a < 2 , then 1 < λ 1 = λ 2 < 1 , the fixed point P 2 is a stable node; if a < 2 or a > 2 , then λ 1 = λ 2 > 1 , the fixed point P 2 is an unstable node.
(2) When a 2 8 a 6 b + 8 < 0 , λ 1 = a + i a 2 + 8 a + 6 b 8 2 and λ 2 = a i a 2 + 8 a + 6 b 8 2 are a pair of conjugate complex numbers, which are equivalent to
λ 1 = 8 a + 6 b 8 4 e i arctan a 2 + 8 a + 6 b 8 a , λ 2 = 8 a + 6 b 8 4 e i arctan a 2 + 8 a + 6 b 8 a .
If λ 1 = λ 2 = 1 , b = 2 4 a 3 . Meanwhile, a 2 8 a 6 b + 8 < 0 , we can deduce 2 < a < 2 . When 4 3 4 a 3 < b < 2 4 a 3 , λ 1 = λ 2 < 1 , thus P 2 is a stable focus; when b > 2 4 a 3 , λ 1 = λ 2 > 1 , thus P 2 is an unstable focus.
(3) When a 2 8 a 6 b + 8 > 0 , λ 1 = a + a 2 8 a 6 b + 8 2 and λ 2 = a a 2 8 a 6 b + 8 2 are two real numbers. It is clearly λ 1 > λ 2 , with discussions as follows:
① It is supposed that λ 1 > λ 2 > 1 . Since λ 1 > λ 2 , it only needs to satisfy λ 2 = a a 2 8 a 6 b + 8 2 > 1 . It is equivalent to b > 2 3 2 a 3 and a 2 > 0 . Thus, if a > 2 and b > 2 3 2 a 3 , the fixed point P 2 is an unstable node.
② It is supposed that λ 2 < λ 1 < 1 . It only needs λ 1 = a + a 2 8 a 6 b + 8 2 < 1 . A simple calculation can deduce b > 2 3 2 a and 2 a > 0 . Thus, if a < 2 , b > 2 3 2 a , the fixed point P 2 is an unstable node.
③ It is supposed that λ 1 > 1 and λ 2 < 1 . Since a + a 2 8 a 6 b + 8 2 > 1 and a a 2 8 a 6 b + 8 2 < 1 , we can deduce a > 0 , b < 2 3 2 a . Thus, if a < 0 , b < 2 3 ( 1 a ) , the fixed point P 2 is an unstable node.
④ It is supposed that 1 < λ 2 < λ 1 < 1 . Since a + a 2 8 a 6 b + 8 2 < 1 and a a 2 8 a 6 b + 8 2 > 1 , we can deduce that if 2 < a < 0 , then b > 2 3 2 a , the fixed point P 2 is a stable node. If 0 < a < 2 , then b > 2 3 ( 1 a ) , the fixed point P 2 is a stable node.
⑤ It is supposed that λ 1 > 1 , 1 < λ 2 < 1 . Since a + a 2 8 a 6 b + 8 2 > 1 and 1 < a a 2 8 a 6 b + 8 2 < 1 , it can deduce a > 0 , 2 3 2 a < b < 2 3 2 a 3 . Thus, if a > 0 , 2 3 2 a < b < 2 3 2 a 3 , the fixed point P 2 is a saddle.
⑥ It is supposed that 1 < λ 1 < 1 and λ 2 < 1 . Since 1 < a + a 2 8 a 6 b + 8 2 < 1 , a a 2 8 a 6 b + 8 2 < 1 , we can deduce that a < 0 , 2 3 ( 1 a ) < b < 2 3 2 a . Thus, if a < 0 , 2 3 ( 1 a ) < b < 2 3 2 a , the fixed point P 2 is a saddle. □

3. Bifurcation Analysis

With the discussion of Section 2.2, it can be found that the stability at P 1 0 , 0 can be changed at b = 2 3 , b = 2 3 1 a and b = 2 3 1 + a . Therefore, we will study the bifurcations at the fixed point P 1 0 , 0 for b = 2 3 , b = 2 3 1 a and b = 2 3 1 + a in this section.
Lemma 1.
(Naimark–Sacker Bifurcation Existence Theorem for Discrete Dynamical Systems [24]): Let f μ : R 2 R 2 be a one-parameter family of mappings which has a smooth family of fixed points x ( μ ) at which the eigenvalues are complex conjugates λ ( μ ) , λ ¯ ( μ ) . Assume
(SH1) λ ( μ 0 ) = 1 , but λ j ( μ 0 ) 1 for j = 1 , 2 , 3 , 4 .
(SH2) d d μ ( λ ( μ 0 ) ) = d 0 .
Then, there is a smooth change in coordinates h so that the expression of h f μ h 1 in polar coordinates has the form
h f μ h 1 ( r , θ ) = ( r ( 1 + d ( μ μ 0 ) + a r 2 , θ + c + b r 2 ) + higher - order   terms
(Note: λ complex and (SH2) imply arg ( λ ) = c and d are nonzero).
If, in addition
(SH3) a 0 .
Then, there is a two-dimensional surface Σ (not necessarily infinitely differentiable) in R 2 × R having quadratic tangency with the plane R 2 × { μ 0 } which is invariant for f μ . If Σ ( R 2 × { μ } ) is larger than a point, then it is a simple closed curve.
Assume that the bifurcating system (restricted to the center manifold) is in the form
x y cos ( c ) sin ( c ) sin ( c ) cos ( c ) x y + f ( x , y ) g ( x , y )
With eigenvalues λ , λ ¯ = e ± i c , one obtains
a = Re ( 1 2 λ ) λ ¯ 2 1 λ ξ 11 ξ 20 1 2 ξ 11 2 ξ 02 2 + Re ( λ ¯ ξ 21 )
where
ξ 20 = 1 8 ( f x x f y y + 2 g x y ) + i ( g x x g y y 2 f x y )
ξ 11 = 1 4 ( f x x + f y y ) + i ( g x x + g y y )
ξ 02 = 1 8 ( f x x f y y 2 g x y ) + i ( g x x g y y + 2 f x y )
ξ 21 = 1 16 ( f x x x + f x y y + g x x y + g y y y ) + i ( g x x x + g x y y f x x y f y y y )
Theorem 3.
If 2 < a < 2 and a 1 , 0, the two-dimensional two-parameter squared discrete dynamical system (1) has a Naimark–Sacker bifurcation at the fixed point P 1 0 , 0 for b = 2 3 .
Proof. 
For the two-dimensional two-parameter squared discrete dynamical system (1), it is assumed that the Jacobian matrix at the fixed point P 1 0 , 0 has a pair of conjugate complex eigenvalues λ = a + a 2 + 6 b 2 and λ ¯ = a a 2 + 6 b 2 .
To ensure that λ b = a 2 4 + a 2 6 b 4 = 3 b 2 = 1 , it only needs 3 b 2 = 1 , i.e., b = 2 3 . Let Δ = a 2 + 6 b < 0 ; it can deduce that b < a 2 6 and 2 < a < 2 .
After a simple calculation, we can derive that if a 1 , 0 , then λ 2 3 n 1 , where n = 1 , 2 , 3 , 4 . And d d b λ 2 3 = 3 4 0 .
We use the translation x y = 3 a 0 1 4 a 2 a u v ; the discrete dynamical system (1) becomes
u v a 2 4 a 2 2 4 a 2 2 a 2 u v + 0 6 u 2 a 4 a 2
According to Lemma 1, we can obtain
ξ 20 = i ( 3 2 a 4 a 2 ) ,   ξ 11 = i ( 3 a 4 a 2 ) ,   ξ 02 = i ( 3 2 a 4 a 2 ) ,   ξ 21 = 0 ,
With eigenvalues λ , λ ¯ = a ± i 4 a 2 2
α = Re ( 1 2 λ ) λ ¯ 2 1 λ ξ 11 ξ 20 1 2 ξ 11 2 ξ 02 2 + Re ( λ ¯ ξ 21 ) = 9 a 4 + 27 a 3 + 9 a 2 27 a 54 4 a 2 ( 2 a ) ( 4 a 2 )
When 2 < a < 2 , α 0 .
Thus, if 2 < a < 2 and a 1 , 0, b = 2 3 , the two-dimensional two-parameter squared discrete dynamical system (1) has a Naimark–Sacker bifurcation at the fixed point P 1 0 , 0 . □
Theorem 4. 
If a 0 ,   1 ,   2 , the two-dimensional two-parameter squared discrete dynamical system (1) undergoes a transcritical bifurcation at the fixed point P 1 0 , 0 for b = 2 3 ( 1 a ) .
Proof. 
Since b = 2 3 ( 1 a ) , and a 0 , b 0 in discrete dynamical system (1), thus, a 0 , 1 . Let b ¯ = b 2 3 1 a ; we consider the parameter b ¯ as an independent variable; then, the discrete dynamical system (1) becomes
x a x + 3 2 y y 2 3 1 a x + b ¯ x b ¯ b ¯ b ¯ x 2 2 3 1 a x 2
Rewrite the discrete dynamical system (3) in the following form:
x n + 1 y n + 1 b ¯ n + 1 = a 3 2 0 2 3 1 a 0 0 0 0 1 x n y n b ¯ n + 0 b ¯ n x n b ¯ n x n 2 2 3 1 a x n 2 0
When a 2 , the matrix T = 3 0 3 2 ( 1 a ) 0 2 0 1 0 is invertible. We use the translation
x n y n b ¯ n = T u n v n μ n = 3 u n + 3 μ n 2 1 a u n 2 μ n v n
Then, the discrete dynamical system (4) becomes
u n + 1 v n + 1 μ n + 1 = 1 0 0 0 1 0 0 0 a 1 u n v n μ n + f u n , v n , μ n 0 g u n , v n , μ n
where
f u n , v n , μ n = 3 4 2 a v n u n + μ n 9 4 2 a v n u n + μ n 2 3 2 a 1 a u n + μ n 2
g u n , v n , μ n = 3 2 a 4 v n u n + μ n + 9 4 2 a v n u n + μ n 2 + 3 2 a 1 a u n + μ n 2
Using the center manifold theorem, let
W c 0 = u , v , μ R 3 | μ = h u , v , h 0 , 0 = 0 , D h 0 , 0 = 0
for u and v sufficiently small. We assume that the center manifold takes the form
μ = h u , v = a 1 u 2 + a 2 u v + a 3 v 2 + a 4 u 3 + o u + v 3
where h ( 0 , 0 ) = 0   h ( 0 , 0 ) = 0 ,   D h ( 0 , 0 ) = 0 [25,26,27].
Since μ n + 1 = h u n + f u n , v n , μ n , v n and μ n + 1 = a 1 μ n + g u n , v n , μ n , thus,
h u n + f u n , v n , μ n , v n a 1 μ n g u n , v n , μ n = 0 .
The center manifold satisfies
N h u , v = h u + f u , v , μ , v a 1 μ g u , v , μ             = 2 a a 1 3 1 a 2 a u 2 + 2 a a 2 3 2 a 4 u v + 2 a a 3 v 2               + 6 1 a a 2 a 1 + 2 a a 4 u 3 + o u + v 3           = 0
By calculating, we obtain
a 1 = 3 1 a 2 a 2 , a 2 = 3 2 2 a 2 , a 3 = 0 , a 4 = 36 1 a 2 2 a 4
and thus μ = h ( u , v ) = 3 1 a 2 a 2 u 2 + 3 2 2 a 2 u v + 36 1 a 2 2 a 4 u 3 + o u + v 3 .
The discrete dynamical system (5) restricted to W c ( 0 ) is given by
u f ¯ u , v = u + f u , v , μ = u + 3 4 2 a u v 3 1 a 2 a u 2 18 1 a 2 2 a 3 u 3 + o u + v 3 .
With calculation, f ¯ 0 , 0 = 0 , f ¯ 0 , 0 u = 1 , f ¯ 0 , 0 v = 0 , 2 f ¯ 0 , 0 u v = 3 4 2 a 0   ( a 2 ) , 2 f ¯ 0 , 0 u 2 = 6 ( a 1 ) 2 a 0   ( a 1 ,   2 ) . According the bifurcation theory [13], the discrete dynamical system (5) undergoes transcritical bifurcation at u , v , μ = 0 , 0 , 0 . That is, if a 0 ,   1 ,   2 , the two-dimensional two-parameter squared discrete dynamical system (1) undergoes a transcritical bifurcation at the fixed point P 1 0 , 0 for b = 2 3 ( 1 a ) . □
Theorem 5. 
If a 2 , 1 , 0 , the two-dimensional two-parameter squared discrete dynamical system (1) undergoes a flip bifurcation at the fixed point P 1 0 , 0 for b = 2 3 ( 1 + a ) . If a < 2 or 2 < a < 1 or 1 < a < 0 , the period two points are stable and lie on left side of b = 2 3 ( 1 + a ) . If a > 0 , the period two points are unstable and lie on right side of b = 2 3 ( 1 + a ) .
Proof. 
Since b = 2 3 ( 1 + a ) , and a 0 , b 0 in discrete dynamical system (1), thus, a 1 , 0 .
Let b ¯ = b 2 3 1 + a ; we consider the parameter b ¯ as an independent variable; then, the discrete dynamical system (1) becomes
x a x + 3 2 y y 2 3 1 + a x + b ¯ x b ¯ x 2 2 3 1 + a x 2 b ¯ b ¯
Rewrite the discrete dynamical system (6) in the following form:
x n + 1 y n + 1 b ¯ n + 1 = a 3 2 0 2 3 1 + a 0 0 0 0 1 x n y n b ¯ n + 0 b ¯ n x n b ¯ n x n 2 2 3 1 + a x n 2 0
When a 2 , the matrix T = 3 3 0 2 ( 1 + a ) 2 0 0 0 1 is invertible. We use the translation
x n y n b ¯ n = T u n v n μ n = 3 u n + 3 v n 2 1 + a u n + 2 v n μ n
and then the discrete dynamical system (7) becomes
u n + 1 v n + 1 μ n + 1 = 1 0 0 0 a + 1 0 0 0 1 u n v n μ n + f u n , v n , μ n g u n , v n , μ n 0
where
f u n , v n , μ n = 3 4 + 2 a μ n v n u n 9 4 + 2 a μ n v n u n 2 3 1 + a 2 + a v n u n 2
g u n , v n , μ n = 3 4 + 2 a μ n v n u n 9 4 + 2 a μ n v n u n 2 3 1 + a 2 + a v n u n 2
Using the center manifold theorem, let
W c 0 = u , v , μ R | v = h u , μ , h 0 , 0 = 0 , D h 0 , 0 = 0
for u and μ sufficiently small. We assume that the center manifold takes the form
v = h u , μ = b 1 u 2 + b 2 u μ + b 3 μ 2 + b 4 u 3 + o u + μ 3
where h ( 0 , 0 ) = D h ( 0 , 0 ) = 0 .
Since v n + 1 = h u n + 1 , μ n + 1 = h u n + f u n , v n , μ n , μ n and v n + 1 = a + 1 v n + g u n , v n , μ n , thus, h u n + f u n , v n , μ n , μ n a + 1 v n g u n , v n , μ n = 0 .
The center manifold satisfies
N h u , μ = h u + f u , v , μ , μ a + 1 v g u , v , μ               = 3 ( 1 + a ) 2 + a a b 1 u 2 + 2 a b 2 + 3 4 + 2 a u μ a b 3 μ 2 ( 2 + a ) b 4 μ 3 + o u + μ 3               = 0
After calculation, we obtain b 1 = 3 ( 1 + a ) a ( 2 + a ) , b 2 = 3 2 2 + a 2 , b 3 = 0 , b 4 = 0 , thus
v = h ( u , μ ) = 3 ( 1 + a ) a 2 + a u 2 + 3 2 2 + a 2 u μ + o u + μ 3
The discrete dynamical system (8) restricted to W c ( 0 ) is given by
u f ¯ u , μ = u 3 4 + 2 a u μ 3 1 + a 2 + a u 2 + 18 1 + a 2 a 2 + a 2 u 3 + o u + μ 3
With calculation, f ¯ 0 , 0 = 0 , f ¯ u 0 , 0 = 1 , f ¯ 2 0 , 0 μ = 0 , 2 f ¯ 2 0 , 0 u 2 = 0 ,
2 f ¯ 2 0 , 0 u μ = 3 2 + a 0   ( a 2 ) ,   3 f ¯ 2 0 , 0 u 3 = 108 ( 1 + a ) 2 a ( 2 + a ) 0   ( a 2 , 1 , 0 ) ,
3 f ¯ 2 0 , 0 u 3 2 f ¯ 2 0 , 0 u μ = ( 1 + a ) 2 a .
According the bifurcation theory, system (8) then undergoes a flip bifurcation at u , v , μ = 0 , 0 , 0 . Thus, a 2 , 1 , 0 ; the two-dimensional two-parameter squared discrete dynamical system (1) undergoes a flip bifurcation at the fixed point P 1 0 , 0 for b = 2 3 ( 1 + a ) . Moreover, if a < 2 or 2 < a < 1 or 1 < a < 0 , the period two points are stable and lie on left side of b = 2 3 ( 1 + a ) . If a > 0 , the period two points are unstable and lie on right side of b = 2 3 ( 1 + a ) . □

4. Numerical Analysis

4.1. Numerical Simulations on the Existence of Bifurcations in the Proposed System (1)

In this section, numerical analysis is carried out to illustrate the bifurcation behaviors described in the above theorems for the two-dimensional two-parameter squared discrete dynamical system (1).
When a = 0.2 , b changes from 1 to 0.01 . Figure 1 is the bifurcation diagram, showing the output of x component with respect to b , with initial state ( x 0 , y 0 ) = ( 0.02 , 0.01 ) . After a simple calculation, there is a Naimark–Sacker bifurcation at the fixed point (0, 0), when a = 0.2 , b = 2 3 . The phase portrait of an invariant circle for b = 0.6717 is shown in Figure 2.
When a = 0.3 , Figure 3 lists the maximum modulus of the eigenvalues of Jacobian Matrix at ( 0 , 0 ) with respect to b , with the initial state ( x 0 , y 0 ) = ( 0.001 , 0.001 ) . When a = 0.3 , b = 2 3 ( 1 a ) = 0.4667 . From Figure 3, if b < 0.4667 , the maximum modulus of the eigenvalues of the Jacobian matrix at ( 0 , 0 ) are all less than one, and if b > 0.4667 , the maximum modulus of the eigenvalues of Jacobian matrix at ( 0 , 0 ) are all larger than one. Thus, there is a transcritical bifurcation for a = 0.3 , b = 2 3 ( 1 a ) = 0.4667 , just as Figure 4 shows.
When a = 0.2 , b = 2 3 ( 1 + a ) 0.5333 and 3 f ¯ 2 0 , 0 u 3 2 f ¯ 2 0 , 0 u μ < 0 . According to Theorem 5, these are the stable period-two points. Figure 5 is the phase portrait of system (1) for ( x 0 , y 0 ) = ( 0.02 , 0.01 ) , a = 0.2 , b = 0.5333 . From Figure 5, we can see period-two fixed points. Thus, system (1) undergoes a flip bifurcation at the fixed point P 1 0 , 0 for b = 2 3 ( 1 + a ) .

4.2. Numerical Simulations of Image Encryption with the Proposed Bifurcation System (1)

The above numerical analyses indicate that the proposed system (1) has complex bifurcation behaviors; therefore, it can easily lead to chaos. While the chaotic system has a series of characteristics that are exactly consistent with the requirements of cryptography, image encryption algorithms based on chaotic theory have become a hot research field recently. When ( x 0 , y 0 ) = ( 0.01 , 0.01 ) , a = 0.3 , b = 1.93 , the proposed system (1) is chaotic. Figure 6 is a chaotic attractor.
Under the same conditions, the proposed system (1) is employed in chaos-based image encryption algorithms. The grey image ’Lena’ is encrypted by the proposed system (1). The encryption and decryption results are shown in Figure 7. We can see that no valid information about the plaintext image can be obtained from the encrypted image. Thus, the image encryption with the proposed system (1) is effective.
In order to verify the good encryption effect of the proposed system (1), several simulation experiments on the image encryption with ‘Lena’ are carried out in this section. The information entropy of the encrypted images with the different two-dimensional discrete systems [14,20,28] is listed in Table 1. It indicates that the encrypted image with the proposed system (1) is close to eight; this means that the encrypted image with the proposed system (1) has a good random distribution. The number of pixel changing rate (NPCR) and the unified averaged changed intensity (UACI) are listed in Table 2 to measure the sensitivity of the encryption to plaintext. From Table 2, NPCR and UACI in the proposed system (1) are a little more than the other contrast systems. These results show that the encryption security performance of the proposed system (1) is a bit more effective than the other contrast systems. Thus, the proposed system (1) has an advantage in image encryption.

5. Conclusions

The analysis of the dynamic behavior of two-dimensional discrete dynamic systems is critical for bridging the gap between one-dimensional and high-dimensional discrete dynamic systems. Investigating two-dimensional discrete dynamic systems provides valuable insights into the complexities associated with high-dimensional discrete dynamic systems.
This paper investigates the theoretical and numerical analysis of the bifurcation behavior of a two-dimensional two-parameter squared discrete dynamical system. The local stability conditions at the fixed points are discussed based on stability theory, and critical parameter values for the proposed system are derived. Utilizing the center manifold theorem and bifurcation theory, this study explores the conditions for flip bifurcation, transcritical bifurcation, and Naimark–Sacker bifurcation in the proposed system. Finally, numerical simulations demonstrate that these two-dimensional two-parameter squared discrete dynamical systems exhibit complex bifurcations and can be effectively utilized in image encryption.

Author Contributions

Conceptualization, L.L. and X.Z.; methodology, L.L. and X.Z.; software, L.L. and X.Z.; validation, L.L. and X.Z.; writing—original draft preparation, L.L. and X.Z.; writing—review and editing, L.L. and X.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data is included in the article, further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Strogatz, S. Sync: The Emerging Science of Spontaneous Order; Hyperion: New York, NY, USA, 2003. [Google Scholar]
  2. Udwadia, F.E.; Raju, N. Dynamics of coupled nonlinear maps and its application to ecological modeling. Appl. Math. Comput. 1997, 82, 137–179. [Google Scholar] [CrossRef]
  3. Zengru, D.; Sanglier, M. A two-dimensional logistic model for the interaction of demand and supply and its bifurcations. Chao Solitons Fractals 1996, 7, 2259–2266. [Google Scholar] [CrossRef]
  4. Barrat, A.; Barthelemy, M.; Vespignani, A. Dynamical Processes on Complex Networks; Cambridge University Press: Cambridge, UK, 2008. [Google Scholar]
  5. Jike, W.; Kefu, H. Bifurcation Problems and Numerical Methods for Them; Beijing Institute of Technology Press: Beijing, China, 2019. [Google Scholar]
  6. May, R.M. Simple mathematical models with very complicated dynamics. Nature 1976, 261, 459–467. [Google Scholar] [CrossRef] [PubMed]
  7. Whitley, D. Discrete dynamical systems in dimensions one and two. Bull. Lond. Math. Soc. 1983, 15, 177–217. [Google Scholar] [CrossRef]
  8. Pareek, N.K.; Patidar, V.; Sud, K.K. Image encryption using chaotic logistic map. Image Vis. Comput. 2006, 24, 926–934. [Google Scholar] [CrossRef]
  9. Li, S.; Ding, W.; Yin, B. A novel delay linear coupling logistics map model for color image encryption. Entropy 2018, 20, 463. [Google Scholar] [CrossRef] [PubMed]
  10. Kumar, A.; Alzabut, J.; Kumari, S. Dynamical properties of a novel one dimensional chaotic map. Math. Biosci. Eng. 2022, 19, 2489–2505. [Google Scholar] [CrossRef] [PubMed]
  11. Huang, H.; Yang, S.; Ye, R. Efficient symmetric image encryption by using a novel 2D chaotic system. IET Image Process. 2020, 14, 1157–1163. [Google Scholar] [CrossRef]
  12. Zhang, Y.Q.; He, Y.; Wang, X.Y. Spatiotemporal chaos in mixed linear–nonlinear two-dimensional coupled logistic map lattice. Phys. A Stat. Mech. Its Appl. 2018, 490, 148–160. [Google Scholar] [CrossRef]
  13. Wiggins, S. Introduction to Applied Nonlinear Dynamical Systems and Chaos; Springer Science + Business Media: New York, NY, USA, 1990; Volume 9. [Google Scholar]
  14. Benedicks, M.; Carleson, L. The dynamics of the Hénon map. Ann. Math. 1991, 133, 73–169. [Google Scholar] [CrossRef]
  15. Peng, Y.; Sun, K.; He, S. A discrete memristor model and its application in Hénon map. Chaos Solitons Fractals 2020, 137, 109873. [Google Scholar] [CrossRef]
  16. Gao, X. A color image encryption algorithm based on an improved Hénon map. Phys. Scr. 2021, 96, 065203. [Google Scholar] [CrossRef]
  17. Ran, J. Discrete chaos in a novel two-dimensional fractional chaotic map. Adv. Differ. Equ. 2018, 2018, 294. [Google Scholar] [CrossRef]
  18. Soula, Y.; Jahanshahi, H.; Al-Barakati, A.A.; Moroz, I. Dynamics and Global Bifurcations in Two Symmetrically Coupled Noninvertible Maps. Mathematics 2023, 11, 1517. [Google Scholar] [CrossRef]
  19. Elsadany, A.A.; Yousef, A.M.; Elsonbaty, A. Further analytical bifurcation analysis and applications of coupled logistic maps. Appl. Math. Comput. 2018, 338, 314–336. [Google Scholar] [CrossRef]
  20. Gao, Y. Complex dynamics in a two-dimensional noninvertible map. Chaos Solut. Fractals 2009, 39, 1798–1810. [Google Scholar] [CrossRef]
  21. Meng, J.D.; Bao, B.C.; Xu, Q. Dynamics of two-dimensional parabolic discrete mapping. J. Phys. 2011, 60, 010504. [Google Scholar]
  22. Chowdhury, R.A.; Chowdhury, K. Bifurcations in a coupled logistic map. Int. J. Theor. Phys. 1991, 30, 97–106. [Google Scholar] [CrossRef]
  23. Kaneko, K. From globally coupled maps to complex-systems biology. Chaos Interdiscip. J. Nonlinear Sci. 2015, 25, 097608. [Google Scholar] [CrossRef] [PubMed]
  24. Guckenheimer, J.; Holmes, P. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields; Applied Mathematical Sciences; Springer Science + Business Media: New York, NY, USA, 1983; Volume 42, pp. 162–165. [Google Scholar]
  25. Koepf, W. Efficient computation of truncated power series: Direct approach versus newton’s method. Util. Math. 2010, 83, 37. [Google Scholar]
  26. Guariglia, E. Fractional calculus, zeta functions and Shannon entropy. Open Math. 2021, 19, 87–100. [Google Scholar] [CrossRef]
  27. Ripon, S.M. Generalization of a class of logarithmic integrals. Integral Transform. Spec. Funct. 2015, 26, 229–245. [Google Scholar] [CrossRef]
  28. Li, B.; He, Q. Bifurcation analysis of a two-dimensional discrete Hindmarsh-Rose type model. Adv. Differ. Equ. 2019, 2019, 124. [Google Scholar] [CrossRef]
Figure 1. The output of x component with respect to a = 0.2 for 1 b = 0.01 .
Figure 1. The output of x component with respect to a = 0.2 for 1 b = 0.01 .
Mathematics 12 02423 g001
Figure 2. Phase portrait of system (1) for ( x 0 , y 0 ) = ( 0.02 , 0.01 ) , a = 0.2 , b = 0.6717 .
Figure 2. Phase portrait of system (1) for ( x 0 , y 0 ) = ( 0.02 , 0.01 ) , a = 0.2 , b = 0.6717 .
Mathematics 12 02423 g002
Figure 3. Maximum modulus of the eigenvalues of Jacobian matrix at ( 0 , 0 ) with respect to b.
Figure 3. Maximum modulus of the eigenvalues of Jacobian matrix at ( 0 , 0 ) with respect to b.
Mathematics 12 02423 g003
Figure 4. Output of x component with respect to b for a = 0.3 .
Figure 4. Output of x component with respect to b for a = 0.3 .
Mathematics 12 02423 g004
Figure 5. Phase portrait of system (1) for ( x 0 , y 0 ) = ( 0.02 , 0.01 ) , a = 0.2 , b = 0.5333 .
Figure 5. Phase portrait of system (1) for ( x 0 , y 0 ) = ( 0.02 , 0.01 ) , a = 0.2 , b = 0.5333 .
Mathematics 12 02423 g005
Figure 6. Phase portrait of the proposed system (1) with ( x 0 , y 0 ) = ( 0.01 , 0.01 ) , a = 0.3 , b = 1.93 .
Figure 6. Phase portrait of the proposed system (1) with ( x 0 , y 0 ) = ( 0.01 , 0.01 ) , a = 0.3 , b = 1.93 .
Mathematics 12 02423 g006
Figure 7. Encryption and decryption results with the proposed system (1).
Figure 7. Encryption and decryption results with the proposed system (1).
Mathematics 12 02423 g007
Table 1. Information entropy test results.
Table 1. Information entropy test results.
Discrete MapRGB
The proposed system (1)7.99937.99927.9993
Ref. [14]7.99947.99947.9994
Ref. [20]7.99947.99947.9993
Ref. [28]7.99927.99937.9993
Table 2. NPCR and UACI.
Table 2. NPCR and UACI.
Discrete MapNPCR (%)UACI (%)
The proposed system (1)99.61530.427
Ref. [14]99.60730.388
Ref. [20]99.60830.424
Ref. [28]99.61430.42
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

Liu, L.; Zhong, X. Research on Stability and Bifurcation for Two-Dimensional Two-Parameter Squared Discrete Dynamical Systems. Mathematics 2024, 12, 2423. https://doi.org/10.3390/math12152423

AMA Style

Liu L, Zhong X. Research on Stability and Bifurcation for Two-Dimensional Two-Parameter Squared Discrete Dynamical Systems. Mathematics. 2024; 12(15):2423. https://doi.org/10.3390/math12152423

Chicago/Turabian Style

Liu, Limei, and Xitong Zhong. 2024. "Research on Stability and Bifurcation for Two-Dimensional Two-Parameter Squared Discrete Dynamical Systems" Mathematics 12, no. 15: 2423. https://doi.org/10.3390/math12152423

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