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

: 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.


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 onedimensional 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 twoparameter 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.

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 where a ̸ = 0, b ̸ = 0.
(3) When a 2 + 6b > 0, the eigenvalues λ 1 , λ 2 are two real numbers.It is obviously λ 1 > λ 2 .A discussion is as follows: 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 The Jacobian matrix at the fixed point is given by

and the eigenvalues are given by λ
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 − 8a − 6b + 8 = 0:

6
, P 2 is an unstable node.
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 With eigenvalues λ, λ = e ±ic , one obtains where 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+ We use the translation According to Lemma 1, we can obtain 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).
; we consider the parameter b as an independent variable; then, the discrete dynamical system (1) becomes Rewrite the discrete dynamical system (3) in the following form: When a ̸ = 2, the matrix Then, the discrete dynamical system (4) becomes where Using the center manifold theorem, let for u and v sufficiently small.We assume that the center manifold takes the form where h(0, 0) = 0 h(0, 0) = 0, Dh(0, 0) = 0 [25][26][27]. Since The center manifold satisfies By calculating, we obtain . 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 = (1 + a); we consider the parameter b as an independent variable; then, the discrete dynamical system (1) becomes Rewrite the discrete dynamical system (6) in the following form: When a ̸ = −2, the matrix and then the discrete dynamical system (7) becomes where Using the center manifold theorem, let for u and µ sufficiently small.We assume that the center manifold takes the form where h(0, 0) = Dh(0, 0) = 0. Since The center manifold satisfies The discrete dynamical system (8) restricted to W c (0) is given by 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 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., the maximum modulus of the eigenvalues of the Jacobian matrix at (0 , 0) are all less than one, and if 0.4667 b > , the maximum modulus of the eigenvalues of Jacobian matrix at (0 , 0) are all larger than one.

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 , the proposed system (1) is chaotic.Figure 6 is a chaotic attractor.

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 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.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 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.

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.

Figure 3 .
Figure 3. Maximum modulus of the eigenvalues of Jacobian matrix at (0, 0) with respect to b.

Figure 3 .
Figure 3. Maximum modulus of the eigenvalues of Jacobian matrix at (0 , 0) with respect to b.

Figure 4 .
Figure 4. Output of x component with respect to bfor 0.3 a = .

Figure 7 .
Figure 7. Encryption and decryption results with the proposed system (1).

Figure 7 .
Figure 7. Encryption and decryption results with the proposed system (1).

Figure 7 .
Figure 7. Encryption and decryption results with the proposed system (1).

Table 1 .
Information entropy test results.