Next Article in Journal
Intelligent Adaptive Reaching Law-Based Arbitrary Fixed-Time SMC for Quadcopter Under Disturbances
Previous Article in Journal
Locally Irregular-Connected Graphs
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Note on the Control of Trajectories of a Dynamical System Modeling Genetic Networks

by
Felix Sadyrbaev
1,2
1
Institute of Life Sciences and Technology, Daugavpils University, Parades Street 1A, LV-5401 Daugavpils, Latvia
2
Institute of Mathematics and Computer Science, University of Latvia, Rainis Boul. 29, LV-1459 Riga, Latvia
Mathematics 2026, 14(11), 1829; https://doi.org/10.3390/math14111829
Submission received: 6 April 2026 / Revised: 10 May 2026 / Accepted: 14 May 2026 / Published: 25 May 2026

Abstract

The discussion of mathematical modeling of diseases in terms of disruptions in the corresponding genetic network is present in the literature. When modeling using dynamic systems, it is possible to observe the evolution of processes. The state trajectory of a genetic network can tend toward an attractor, conventionally called pathogenic. Treatment (in the mathematical model) can be associated with redirecting the trajectory to a conventionally normal attractor. In the model, this can be done by purposefully changing the adjustable parameters. This article considers this situation for an artificially constructed system. Changing one of the parameters is sufficient to redirect the necessary trajectory to the normal attractor, which solves the problem.

1. Introduction

Gene regulatory networks (GRNs) are understood as a set of interacting regulators existing in any cell of any living organism and responsible for any important functions, including morphogenesis, adaptation to changing in the environment, etc. The study of GRNs is a laborious process, which consists of gathering the experimental data, processing them, and making conclusions. Based on this analysis the mathematical model can be inferred that is to be used for a mathematical analysis and making conclusions that can help to understand the processes in a real GRN. Many papers have been prepared that provide the application of mathematical tools for the study of GRNs. They can be found in the review articles, which are numerous, including [1,2,3,4]. The mechanism of constructing a mathematical model from biological data is focused on in [3,5].
A convenient mathematical apparatus based on ordinary differential equations was proposed by Wilson and Cowan in [6]. This system was designed to describe various interactions between two populations of neurons. Later, its n-dimensional version was used in multiple contexts, and for the description of gene networks of arbitrary size also. This system is (1) in the next section. It consists of a linear part and a nonlinear bounded one, so that all solutions are extendable to infinity. Due to its structure, it has an invariant set in the phase space, and trajectories are trapped by this set. Therefore it can have attractors, which play an important role in the mathematical modeling of a network. The evolution of a modeled network depends on the location, number and general properties of attractors. These attractors play an important role in the interpretation of the behavior of the solutions of a system.
The role of the study of genetic regulatory networks (GRNs) in the study of biomedical problems cannot be underestimated. In several articles, the reaction of a subnetwork of a GRN to the development of some diseases was considered, notably works [7,8,9,10], and others.
In [11], the genetic regulatory network ruling the expression of the genes involved in the angioedema disease is illustrated by the scheme of connections. Additional analysis reveals that there are several attractors in the form of 11 fixed points and no periodic attractors. The pathologic attractor corresponding to the hereditary form of the disease has a relative size equal to about 5 of the possible states of the network. A particular attractor in the form of a fixed point has a basin of attraction that comprises 93.43 percent of the possible states of the network.
In [9], the authors constructed an aging gene regulatory network consisting of the core cell cycle regulatory genes (including p53). They obtained a conceptual model for capturing three distinct stable steady states (or attractors) corresponding to homeostasis, cell cycle arrest, and senescence or apoptosis. In addition, they applied a computational method to quantify the potential landscape, which displays: (I) one homeostasis attractor for low accumulation of DNA damage; (II) two attractors for cell cycle arrest and senescence (or apoptosis) in response to high accumulation of DNA damage. The process of aging can be characterized by state transitions from landscape I to II. By in silico perturbations, the potential landscape of a perturbed network (inactivation of p53) was identified, and thereby the emergence of a cancer attractor was demonstrated. “The simulated dynamics of the perturbed network display a landscape with four basins of attraction: homeostasis, cell cycle arrest, senescence (or apoptosis) and cancer. Our analysis also showed that for the same perturbed network with low DNA damage the landscape displays only the homeostasis attractor”. The authors expressed the hope that “the mechanistic model offers theoretical insights that can facilitate discovery of potential strategies for network medicine of aging-related diseases such as cancer”.
In [7,8], the three-dimensional Wilson–Cowan type system was considered. The authors were interested in dynamical networks with coexisting attractors. They assumed that the system was static—that is, that it did not change the relations between the elements of a network—the basins of attraction were unchangeable. Given an initial condition, the system approached one of the attractors. This attractor had specific biological–medical significance, and it could be considered as “normal” (“physiological”) versus “undesired” (“pathological”).
The role of inhibitory and activatory cycles was emphasized. The general scheme of considering this topic was as follows. The current state of the networks was described by a trajectory emanating from a prescribed location. Future states were to a great extent associated with the location and number of attractors. One of the main questions to be answered was about the robustness of attractors concerning small perturbations. Another question was about how attractors change given gradual changes in the parameters. A realistic biological network was considered, “T-cells in large granular lymphocyte leukemia associated with the blood cancer”. A T-cell signaling survival network has 60 nodes and many edges. The nodes in the network represent proteins and transcripts, and the edges correspond to either activation or inhibitory regulations. The researchers found three attractors in the physiological network and three corresponding attractors in their model. Two of the physiological attractors were cancerous, and one was normal. In the model, they found multiple ways to drive the system to the normal state by changing the values of properly selected parameters.
In this note, we wish to consider a similar situation, considering a three dimensional Wilson–Cowan-type system that may have several coexisting attractors. We show how to drive the system from any selected attractor to any other. Thus, we demonstrate that in complex networks with multiple attractors and many elements this might be a usual process.
In the next section, we provide the necessary mathematical apparatus. Then we consider several examples and construct means for managing a system in a desired direction. Our conclusions and discussion follow. The examples are appropriately illustrated, and projections of attractors are visible.

2. System

The system we are studying is (1):
x 1 = f 1 ( μ 1 ( w 11 x 1 + + w 1 n x n θ 1 ) ) v 1 x 1 , x 2 = f 2 ( μ 2 ( w 21 x 1 + + w 2 n x n θ 2 ) ) v 2 x 2 , x n = f n ( μ n ( w n 1 x 1 + + w n n x n θ n ) ) v n x n ,
where x i ( t ) are unknowns, μ i , θ i and v i are parameters, and w i j are the entries of the so-called regulatory matrix
W = w 11 w 12 w 1 n w 21 w 22 w 2 n w n 1 w n 2 w n n ,
which is used to describe the interrelations between elements (nodes) of a network. The functions f i may be any sigmoidal functions: that is, monotonically increasing from zero to unity with exactly one inflection point. One such function is f ( z ) = 1 1 + e μ z . There are n + n 2 + n + n parameters in this system, which define the main properties.
Often system (1) is used in the following form:
x 1 = 1 1 + e μ 1 ( w 11 x 1 + + w 1 n x n θ 1 ) v 1 x 1 , x 2 = 1 1 + e μ 2 ( w 21 x 1 + + w 2 n x n θ 2 ) v 2 x 2 , x n = 1 1 + e μ n ( w n 1 x 1 + + w n n x n θ n ) v n x n .
The parameters μ i say how rapidly functions f i go to unity. Values μ i > 1 create nonlinearities strong enough for diverse behaviors, such as switching, bistability, and oscillations. The parameters θ i dictate locations of the graphs of f i with respect to horizontal direction. The coefficients v i > 0 define the natural exponential degradation rates of x i ( t ) solutions, if f are identically zeros. The parameters θ i shift the sigmoid horizontally. Changing θ i moves the switching hyperplane, which affects: the number of equilibria, their stability, the locations of attractors, and transitions between regimes. Thresholds are crucial for control over the network.
Biologically, μ i control how sharply gene i responds to its regulators; w i j is the strength and sign of regulation of gene i by gene j (for instance, w i j > 0 means activation, w i j < 0 means repression); v i is the degradation rate of gene product i; θ i is the activation threshold for gene i. Biologically, thresholds encode sensitivity.
System (1) is quasi-linear, therefore all solutions are extendable to infinity. It possesses an invariant set Q n R n , which traps solutions. Mathematically this is the main reason for the existence of attractors in Q n . The main properties of the system are dependent on the matrix W . Various relations between x i are dependent on the structure of W . This matrix in realistic examples is sparse, so most of its elements are zero.

3. Materials and Methods

For the analysis of dynamical systems and the description of phase space, a geometric approach was used, based on the construction and analysis of nullclines. Attractors were identified and constructed during numerical experiments carried out using the Wolfram Mathematica program. The tools of the same program were used to create the images. The data for repeating the calculations and visualizing the results are provided in the text and in the figure captions.
Suppose that f i are sigmoidal functions that monotonically increase from 0 to 1. Assume that generally nonlinear functions f i are for the description of the relations between elements of a network. These elements have the characteristic x i , which is dependent on the argument t, interpreted as time. Solutions of system (1) are meant as smooth functions x i ( t ) , satisfying the equations in (1). The specific structure of system (1) can be explained in the following way. It is assumed that elements of a network interrelate generally in a nonlinear way and that the x i -th element is affected by the total effect of the remaining elements. To be realistic, this total effect is bounded. The second linear term v i x i means the degradation of the i-th gene expression product; w i j —the connection weight or strength of control of gene j on gene i. Positive values of w i j signify activating influences, whereas negative values denote repressing influences; θ i —the impact of external stimuli on gene i is reflected in its ability to modulate the gene’s responsiveness to activating or repressing factors.
Definition 1.
An invariant region in the phase space is the region that cannot be left by a trajectory of the system (1).
Proposition 1.
The set Q n = { x R n | 0 < x i < 1 / v i , i = 1 , , n } is an invariant set.
Consider the system of equations
0 = f 1 ( x 1 , , x n ) v 1 x 1 , 0 = f 2 ( x 1 , , x n ) v 2 x 2 , 0 = f n ( x 1 , , x n ) v n x n .
Proposition 2.
System (4) has a solution in the invariant set Q n .
Sketch of the Proof. 
On the border of the invariant set Q n vector field Φ = { f i ( x 1 , x 2 , , x n ) x i , i = 1 , n } is directed inward. Therefore, the continuous map Φ maps the topological ball Q n onto itself. So the map Φ has a fixed point in Q n .
Definition 2.
A set of points defined by the relation f i ( x 1 , x 2 , , x n ) v i x i = 0 is called an i-th nullcline of the system (1).
Definition 3.
The cross points of all nullclines are called the critical points of system (1).
Corollary of Proposition 2.
System (1) has a critical point in an invariant set Q n .
Proposition 3.
All critical points of system (1) are in the invariant set Q n .
Proof. 
Any critical point belongs to all nullclines. Any nullcline lies in the strip { 0 < x i < 1 / v i , i = 1 , , n } for some i = 1 , , n . These strips intersect by the set Q n .
Remark 1.
System (1) has at least one critical point but can have multiple critical points.
Critical points are subject to analysis. The standard analysis of a critical point x = ( x 1 , , x n ) involves the following procedure.
Standard analysis. The goal is to obtain a vector λ = ( λ 1 , , λ n ) , that consists of characteristic numbers. The characteristic numbers, with some degenerate cases, provide information on the type of a critical point.
This can be done effectively for system (3). Consider this system (for brevity) in a three-dimensional setting ( v i are set to 1)
x 1 = 1 1 + e μ 1 ( w 11 x 1 + w 12 x 2 + w 13 x 3 θ 1 ) x 1 , x 2 = 1 1 + e μ 2 ( w 21 x 1 + w 22 x 2 + w 23 x 3 θ 2 ) x 2 , x 3 = 1 1 + e μ 3 ( w 31 x + w 32 x 2 + w 33 x 3 θ 3 ) x 3 .
Critical points are solutions of the system
x 1 = 1 1 + e μ 1 ( w 11 x 1 + w 12 x 2 + w 13 x 3 θ 1 ) , x 2 = 1 1 + e μ 2 ( w 21 x 1 + w 22 x 2 + w 23 x 3 θ 2 ) , x 3 = 1 1 + e μ 3 ( w 31 x + w 32 x 2 + w 33 x 3 θ 3 ) .
Linearization at a critical point ( x 1 , , x n ) gives
u 1 = u 1 + μ 1 w 11 g 1 u 1 + μ 1 w 12 g 1 u 2 + μ 1 w 13 g 1 u 3 , u 2 = u 2 + μ 2 w 21 g 2 u 1 + μ 2 w 22 g 2 u 2 + μ 2 w 23 g 2 u 3 , u 3 = u 3 + μ 3 w 31 g 3 u 1 + μ 3 w 32 g 3 u 2 + μ 3 w 33 g 3 u 3 ,
where
g 1 = e μ 1 ( w 11 x 1 + w 12 x 2 + w 13 x 3 θ 1 ) [ 1 + e μ 1 ( w 11 x 1 + w 12 x 2 + w 13 x 3 θ 1 ) ] 2 ,
g 2 = e μ 2 ( w 21 x 1 + w 22 x 2 + w 23 x 3 θ 2 ) [ 1 + e μ 2 ( w 21 x 1 + w 22 x 2 + w 23 x 3 θ 2 ) ] 2 ,
g 3 = e μ 3 ( w 31 x 1 + w 32 x 2 + w 33 x 3 θ 3 ) [ 1 + e μ 3 ( w 31 x 1 + w 32 x 2 + w 33 x 3 θ 3 ) ] 2 .
It follows from (6) that
e μ 1 ( w 11 x 1 + w 12 x 2 + w 13 x 3 θ 1 = 1 x 1 , e μ 2 ( w 21 x 1 + w 22 x 2 + w 23 x 3 θ 2 = 1 x 2 , e μ 3 ( w 31 x 1 + w 32 x 2 + w 33 x 3 θ 3 = 1 x 3 .
Then g i = ( 1 x i ) x i for i = 1 , 2 , 3 , and the coefficient matrix A of the linear system (7) can be written in the form
A = μ 1 w 11 ( 1 x 1 ) x 1 1 μ 1 w 12 ( 1 x 1 ) x 1 μ 1 w 13 ( 1 x 1 ) x 1 μ 2 w 21 ( 1 x 2 ) x 2 μ 2 w 22 ( 1 x 2 ) x 2 1 μ 2 w 23 ( 1 x 2 ) x 2 μ 3 w 31 ( 1 x 3 ) x 3 μ 3 w 32 ( 1 x 3 ) x 3 μ 3 w 33 ( 1 x 3 ) x 3 1 .
The characteristic equation det A λ E = 0 , where E is the unity matrix, is then a cubic equation with coefficients expressed explicitly in terms of the critical point.

4. Results

The phase space of the system (1) contains possible states of a network. The current state of a network is described by the vector X ( t ) = { x 1 ( t ) , , x n ( t ) } , which depends on time. The attractors of the system are geometrical formations of various shapes, which can be revealed by tracing trajectories with the appropriate initial conditions. The phase space is decomposed to several basins of attraction of these trajectories. The problem of reconfiguring the phase space (in fact, only the invariant set Q n ) is the most important. Given the current state X ( t 0 ) at the moment t 0 , one might face the problem of sending the trajectory to a selected region of Q n (to an attractor, which is normal in the context of the studied problem). The three examples in the Introduction are of this kind. Geometrically, this problem is one of intercepting the current trajectory, which goes to a “wrong” attractor, and redirecting it to a “normal” attractor. For this, any adjustable (in the context of a problem) parameters can be used.

4.1. Intercepting Trajectories: The Case of Fixed Point Attractors

Let a network be modeled by a system
x 1 = 1 1 + e 5 ( x 1 0.5 ) x 1 , x 2 = 1 1 + e 5 ( x 2 0.5 ) x 2 , x 3 = 1 1 + e 5 ( x 3 0.5 ) x 3 .
The nullclines are obtained from the relations
x 1 = 1 1 + e 5 ( x 1 0.5 ) , x 2 = 1 1 + e 5 ( x 2 0.5 ) , x 3 = 1 1 + e 5 ( x 3 0.5 )
Geometrically these nullclines are three mutually orthogonal sets by three parallel planes, as is ilustrated by Figure 1 together with Figure 2.
There are several conditionally “normal” attractors (green) and one “pathogenic” (red). The current state of a network is marked in Figure 3 by the yellow point at ( 0.4 , 0.4 , 0.4 ) . The trajectory goes to the red point (“pathogenic”). The problem is to re-send the trajectory from its current location to one of the normal attractors. How to solve it? If the geometry of nullclines is known, this is possible. Notice that all the marked points are at the intersection of all the nullclines. If one of the components of the x 2 -nullcline is eliminated, the “pathogenic” attractor will be eliminated too.
By changing the parameter θ 2 to the value 0.3 the x 2 -nullcline is reduced to only one plane that is defined by x 2 = 0.9653 . The “normal” attractors (green) are slightly shifted, but all four exist. The trajectory in the absence of the “pathogenic” attractor tends to the nearest “normal” one. This process is illustrated by Figure 1, Figure 2, Figure 3, Figure 4, Figure 5 and Figure 6.
Remark 2.
In the preceding example, the locations of the “normal” attractors are changed compared with the initial configuration. This can be corrected. Once it is detected that the trajectory is close enough to a “normal” attractor, all parameters that were changed are to be restored. The trajectory is now in a basin of attraction of a “normal” attractor and the problem is resolved. This attractor is at (0.145, 0.885, 0.145). It is a stable node also with a triple λ = −0.380856.

4.2. Intercepting Trajectories: Periodic Attractors

Consider the system
x 1 = 1 1 + e 5 ( x 1 + x 3 0.5 ) x 1 , x 2 = 1 1 + e 5 ( x 2 0.5 ) x 2 , x 3 = 1 1 + e 5 ( x 1 + x 3 0.5 ) x 3 ,
The nullclines are defined as
x 1 = 1 1 + e 5 ( x 1 + x 3 0.5 ) , x 2 = 1 1 + e 5 ( x 2 0.5 ) , x 3 = 1 1 + e 5 ( x 1 + x 3 0.5 )
The second nullcline is a set of three planes parallel to the ( x 1 , x 3 ) -plane. The nullclines are depicted in Figure 7. The attractors are two closed trajectories that are seen in Figure 8 together with the trajectory emanating from the point ( 0.4 , 0.4 , 0.4 ) . This trajectory is attracted by an attractor depicted in red. It is assumed to be “pathogenic”. The problem is to redirect this trajectory to a green attractor, which is also a closed trajectory. It is considered as “normal”.
The parameter θ 2 is changed to the value θ 2 = 0.41 . The result is seen in Figure 9.

5. Discussion

The current state of a gene network is depicted as a trajectory of a dynamic system. The trajectory can converge to one of the system’s attractors. Attractors are classified as pathogenic and normal. Where a given trajectory goes depends on which basin of attraction it falls into. Being in the wrong basin is interpreted as a diseased state if it concerns a medical problem. The dynamic system has many parameters; some of them can be adjusted, i.e., intentionally changed. This article considers the described situation involving attractors of two types: equilibrium states and periodic solutions. It turns out to be possible in this situation to move the trajectory into the basin of attraction of a normal attractor. It is suggested that this scheme could be applied to real genetic networks.

6. Conclusions

Control and management of a network in a model is an important problem (consult works [11,12,13,14,15,16]). These questions, as can be seen from the examples in the introduction section, are also extremely important in the field of biomedicine. A better understanding of these problems is facilitated by mathematical modeling, in particular by considering the generalized dynamical system of the Cowan–Wilson type. Due to the special structure of the system, special techniques for managing this system need to be developed. The article presents two effective approaches to the problem. The implementation of these approaches should be an urgent task for specialists in the fields of biology, medicine, and mathematics.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Alakwaa, F.M. Modeling of Gene Regulatory Networks: A Literature Review. J. Comput. Syst. Biol. 2014, 1, 102. [Google Scholar] [CrossRef]
  2. Polynikis, A.; Hogan, S.J.; di Bernardo, M. Comparing different ODE modelling approaches for gene regulatory networks. J. Theor. Biol. 2009, 261, 511–530. [Google Scholar] [CrossRef] [PubMed]
  3. Ay, A.; Arnosti, D.N. Mathematical modeling of gene expression: A guide for the perplexed biologist. Crit. Rev. Biochem. Mol. Biol. 2011, 46, 137–151. [Google Scholar] [CrossRef] [PubMed]
  4. Kim, H.; Choi, H.; Lee, D.; Kim, J. A review on gene regulatory network reconstruction algorithms based on single cell RNA sequencing. Gene Genom. 2024, 46, 1–11. [Google Scholar] [CrossRef] [PubMed]
  5. Marku, M.; Pancaldi, V. From time-series transcriptomics to gene regulatory networks: A review of inference methods. PLoS Comput. Biol. 2023, 19, e1011254. [Google Scholar] [CrossRef] [PubMed]
  6. Wilson, H.R.; Cowan, J.D. Excitatory and inhibitory interactions in localized populations of model neurons. Biophys. J. 1972, 12, 1–24. [Google Scholar] [CrossRef] [PubMed]
  7. Wang, L.-Z.; Su, R.-Q.; Huang, Z.-G.; Wang, X.; Wang, W.-X.; Grebogi, C.; Lai, Y.-C. A geometrical approach to control and controllability of nonlinear dynamical networks. Nat. Commun. 2016, 7, 11323. [Google Scholar] [CrossRef] [PubMed]
  8. Cornelius, S.P.; Kath, W.L.; Motter, A.E. Realistic control of network dynamics. Nat. Commun. 2013, 4, 1942. [Google Scholar] [CrossRef] [PubMed]
  9. Chong, K.H.; Zhang, X.; Zheng, J. Dynamical analysis of cellular ageing by modeling of gene regulatory network based attractor landscape. PLoS ONE 2018, 13, E0197838. [Google Scholar] [CrossRef] [PubMed]
  10. Samuilik, I.; Sadyrbaev, F. Mathematical Modeling of Leukemia Treatment. WSEAS Trans. Comput. 2021, 20, 274–281. [Google Scholar] [CrossRef]
  11. Rachdi, M.; Waku, J.; Hazgui, H.; Demongeot, J. Entropy as a Robustness Marker in Genetic Regulatory Networks. Entropy 2020, 22, 260. [Google Scholar] [CrossRef] [PubMed]
  12. Demongeot, J.; Jelassi, M.; Hazgui, H.; Miled, S.B.; Saoud, N.B.B.; Taramasco, C. Biological Networks Entropies: Examples in Neural Memory Networks, Genetic Regulation Networks and Social Epidemic Networks. Entropy 2018, 20, 36. [Google Scholar] [CrossRef] [PubMed]
  13. Brokan, E.; Sadyrbaev, F. On Attractors in Gene Regulatory Systems. AIP Conf. Proc. 2017, 1809, 020010. [Google Scholar] [CrossRef]
  14. Brokan, E.; Sadyrbaev, F. Attraction in n-dimensional differential systems from network regulation theory. Math. Methods Appl. Sci. 2018, 41, 7498–7509. [Google Scholar] [CrossRef]
  15. Smith, H. Oscillations and multiplensteady states in a cyclic gene model with repression. J. Math. Biol. 1987, 25, 169–190. [Google Scholar] [CrossRef] [PubMed]
  16. Banks, H.T.; Mahaffy, J.M. Stability of cyclic for systems involving repressions. J. Theor. Biol. 1978, 74, 323–334. [Google Scholar] [CrossRef] [PubMed]
Figure 1. The nullclines for system (13).
Figure 1. The nullclines for system (13).
Mathematics 14 01829 g001
Figure 2. Cross points correspond to the roots of any equation in (14), r 1 = 0.145 , r 2 = 0.5 , r 3 = 0.855 .
Figure 2. Cross points correspond to the roots of any equation in (14), r 1 = 0.145 , r 2 = 0.5 , r 3 = 0.855 .
Mathematics 14 01829 g002
Figure 3. The trajectory of the system (13) goes from the yellow point to a “wrong” attractor, θ 2 = 0.5 . The red point at ( 0.145 , 0.145 , 0.145 ) is a stable node with triple characteristic number λ = 0.380856 .
Figure 3. The trajectory of the system (13) goes from the yellow point to a “wrong” attractor, θ 2 = 0.5 . The red point at ( 0.145 , 0.145 , 0.145 ) is a stable node with triple characteristic number λ = 0.380856 .
Mathematics 14 01829 g003
Figure 4. The nullclines of the system (13) after adjusting the parameter, θ 2 = 0.3 .
Figure 4. The nullclines of the system (13) after adjusting the parameter, θ 2 = 0.3 .
Mathematics 14 01829 g004
Figure 5. The only root of the second equation in (14) after adjusting the parameter θ 2 = 0.3 .
Figure 5. The only root of the second equation in (14) after adjusting the parameter θ 2 = 0.3 .
Mathematics 14 01829 g005
Figure 6. The intercepted trajectory goes to the nearest of the “normal” attractors (in green), θ 2 = 0.3 .
Figure 6. The intercepted trajectory goes to the nearest of the “normal” attractors (in green), θ 2 = 0.3 .
Mathematics 14 01829 g006
Figure 7. The nullclines for system (15).
Figure 7. The nullclines for system (15).
Mathematics 14 01829 g007
Figure 8. The two periodic attractors (red and green) in system (15), where θ 2 = 0.5 .
Figure 8. The two periodic attractors (red and green) in system (15), where θ 2 = 0.5 .
Mathematics 14 01829 g008
Figure 9. The intercepted trajectory goes to the “normal” attractor, where θ 2 = 0.41 is an adjusted parameter.
Figure 9. The intercepted trajectory goes to the “normal” attractor, where θ 2 = 0.41 is an adjusted parameter.
Mathematics 14 01829 g009
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

Sadyrbaev, F. Note on the Control of Trajectories of a Dynamical System Modeling Genetic Networks. Mathematics 2026, 14, 1829. https://doi.org/10.3390/math14111829

AMA Style

Sadyrbaev F. Note on the Control of Trajectories of a Dynamical System Modeling Genetic Networks. Mathematics. 2026; 14(11):1829. https://doi.org/10.3390/math14111829

Chicago/Turabian Style

Sadyrbaev, Felix. 2026. "Note on the Control of Trajectories of a Dynamical System Modeling Genetic Networks" Mathematics 14, no. 11: 1829. https://doi.org/10.3390/math14111829

APA Style

Sadyrbaev, F. (2026). Note on the Control of Trajectories of a Dynamical System Modeling Genetic Networks. Mathematics, 14(11), 1829. https://doi.org/10.3390/math14111829

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