Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Chaos and stability of a fractional model of the cyber ecosystem

  • Received: 29 April 2024 Revised: 17 June 2024 Accepted: 01 July 2024 Published: 16 July 2024
  • MSC : 65P20, 92D40, 26A33, 34D08

  • The widespread use of computer hardware and software in society has led to the emergence of a type of criminal conduct known as cybercrime, which has become a major worldwide concern in the 21st century spanning multiple domains. As a result, in the present setting, academics and practitioners are showing a great deal of interest in conducting research on cybercrime. In this work, a fractional-order model was replaced by involving three sorts of human populations: online computer users, hackers, and cyber security professionals, in order to examine the online computer user-hacker system. The existence, uniqueness and boundedness were studied. To support our theoretical conclusions, a numerical analysis of the influence of the various logical parameters was conducted and we derived the necessary conditions for the different equilibrium points to be locally stable. We examined the effects of the fear level and refuge factor on the equilibrium densities of prey and predators in order to explore and understand the dynamics of the system in a better way. Using some special circumstances, the model was examined. Our theoretical findings and logical parameters were validated through a numerical analysis utilizing the generalized Adams-Bashforth-Moulton technique.

    Citation: José F. Gómez-Aguilar, Manisha Krishna Naik, Reny George, Chandrali Baishya, İbrahim Avcı, Eduardo Pérez-Careta. Chaos and stability of a fractional model of the cyber ecosystem[J]. AIMS Mathematics, 2024, 9(8): 22146-22173. doi: 10.3934/math.20241077

    Related Papers:

    [1] Xiaoming Su, Jiahui Wang, Adiya Bao . Stability analysis and chaos control in a discrete predator-prey system with Allee effect, fear effect, and refuge. AIMS Mathematics, 2024, 9(5): 13462-13491. doi: 10.3934/math.2024656
    [2] Kottakkaran Sooppy Nisar, G Ranjith Kumar, K Ramesh . The study on the complex nature of a predator-prey model with fractional-order derivatives incorporating refuge and nonlinear prey harvesting. AIMS Mathematics, 2024, 9(5): 13492-13507. doi: 10.3934/math.2024657
    [3] Nehad Ali Shah, Iftikhar Ahmed, Kanayo K. Asogwa, Azhar Ali Zafar, Wajaree Weera, Ali Akgül . Numerical study of a nonlinear fractional chaotic Chua's circuit. AIMS Mathematics, 2023, 8(1): 1636-1655. doi: 10.3934/math.2023083
    [4] A. Q. Khan, Ibraheem M. Alsulami . Complicate dynamical analysis of a discrete predator-prey model with a prey refuge. AIMS Mathematics, 2023, 8(7): 15035-15057. doi: 10.3934/math.2023768
    [5] Xiao-Long Gao, Hao-Lu Zhang, Xiao-Yu Li . Research on pattern dynamics of a class of predator-prey model with interval biological coefficients for capture. AIMS Mathematics, 2024, 9(7): 18506-18527. doi: 10.3934/math.2024901
    [6] Weili Kong, Yuanfu Shao . The effects of fear and delay on a predator-prey model with Crowley-Martin functional response and stage structure for predator. AIMS Mathematics, 2023, 8(12): 29260-29289. doi: 10.3934/math.20231498
    [7] Asharani J. Rangappa, Chandrali Baishya, Reny George, Sina Etemad, Zaher Mundher Yaseen . On the existence, stability and chaos analysis of a novel 4D atmospheric dynamical system in the context of the Caputo fractional derivatives. AIMS Mathematics, 2024, 9(10): 28560-28588. doi: 10.3934/math.20241386
    [8] Yao Shi, Zhenyu Wang . Bifurcation analysis and chaos control of a discrete fractional-order Leslie-Gower model with fear factor. AIMS Mathematics, 2024, 9(11): 30298-30319. doi: 10.3934/math.20241462
    [9] Guilin Tang, Ning Li . Chaotic behavior and controlling chaos in a fast-slow plankton-fish model. AIMS Mathematics, 2024, 9(6): 14376-14404. doi: 10.3934/math.2024699
    [10] Xuyang Cao, Qinglong Wang, Jie Liu . Hopf bifurcation in a predator-prey model under fuzzy parameters involving prey refuge and fear effects. AIMS Mathematics, 2024, 9(9): 23945-23970. doi: 10.3934/math.20241164
  • The widespread use of computer hardware and software in society has led to the emergence of a type of criminal conduct known as cybercrime, which has become a major worldwide concern in the 21st century spanning multiple domains. As a result, in the present setting, academics and practitioners are showing a great deal of interest in conducting research on cybercrime. In this work, a fractional-order model was replaced by involving three sorts of human populations: online computer users, hackers, and cyber security professionals, in order to examine the online computer user-hacker system. The existence, uniqueness and boundedness were studied. To support our theoretical conclusions, a numerical analysis of the influence of the various logical parameters was conducted and we derived the necessary conditions for the different equilibrium points to be locally stable. We examined the effects of the fear level and refuge factor on the equilibrium densities of prey and predators in order to explore and understand the dynamics of the system in a better way. Using some special circumstances, the model was examined. Our theoretical findings and logical parameters were validated through a numerical analysis utilizing the generalized Adams-Bashforth-Moulton technique.



    Throughout the paper, we work over an algebraically closed field k of characteristic zero. Let C be a nonsingular projective curve of genus g0, and L be a very ample line bundle on C. The complete linear system |L| embeds C into a projective space Pr:=P(H0(C,L)). For an integer k0, the k-th secant variety

    Σk=Σk(C,L)Pr

    of C in Pr is the Zariski closure of the union of (k+1)-secant k-planes to C.

    Assume that degL2g+2k+1. Then the k-th secant variety Σk can be defined by using the secant sheaf Ek+1,L and the secant bundle Bk(L) as follows. Denote by Cm the m-th symmetric product of C. Let

    σk+1:Ck×CCk+1

    be the morphism sending (ξ,x) to ξ+x, and p:Ck×CC the projection to C. The secant sheaf Ek+1,L on Ck+1 associated to L is defined by

    Ek+1,L:=σk+1,pL,

    which is a locally free sheaf of rank k+1. Notice that the fiber of Ek+1,L over ξCk+1 can be identified with H0(ξ,L|ξ). The secant bundle of k-planes over Ck+1 is

    Bk(L):=P(Ek+1,L)

    equipped with the natural projection πk:Bk(L)Ck+1. We say that a line bundle L on a variety X separates m+1 points if the natural restriction map H0(X,L)H0(ξ,L|ξ) is surjective for any effective zero-cycle ξX with length(ξ)=m+1. Notice that a line bundle L is globally generated if and only if L separates 1 point, and L is very ample if and only if L separates 2 points. Since degL2g+k, it follows from Riemann–Roch that L separates k+1 points. Then the tautological bundle OBk(L)(1) is globally generated. We have natural identifications

    H0(Bk(L),OBk(L)(1))=H0(Ck+1,Ek+1,)=H0(C,L),

    and therefore, the complete linear system |OBk(L)(1)| induces a morphism

    βk:Bk(L)Pr=P(H0(C,L)).

    The k-th secant variety Σk=Σk(C,L) of C in Pr can be defined to be the image βk(Bk(L)). Bertram proved that βk:Bk(L)Σk is a resolution of singularities (see [1,Section 1]).

    It is clear that there are natural inclusions

    C=Σ0Σ1Σk1ΣkPr.

    The preimage of Σk1 under the morphism βk is actually a divisor on Bk(L). Thus there exits a natural morphism from Bk(L) to the blowup of Σk along Σk1. Vermeire proved that B1(L) is indeed the blowup of Σ1 along Σ0=C ([3,Theorem 3.9]). In the recent work [2], we showed that Bk(L) is the normalization of the blowup of Σk along Σk1 ([2,Proposition 5.13]), and raised the problem asking whether Bk(L) is indeed the blowup itself ([2,Problem 6.1]). The purpose of this paper is to give an affirmative answer to this problem by proving the following:

    Theorem 1.1. Let C be a nonsingular projective curve of genus g, and L be a line bundle on C. If degL2g+2k+1 for an integer k1, then the morphism βk:Bk(L)Σk(C,L) is the blowup of Σk(C,L) along Σk1(C,L).

    To prove the theorem, we utilize several line bundles defined on symmetric products of the curve. Let us recall the definitions here and refer the reader to [2] for further details. Let

    Ck+1=C××Ck+1times

    be the (k+1)-fold ordinary product of the curve C, and pi:Ck+1C be the projection to the i-th component. The symmetric group Sk+1 acts on p1Lpk+1L in a natural way: a permutation μSk sends a local section s1sk+1 to sμ(1)sμ(k+1). Then p1Lpk+1L is invariant under the action of Sk+1, so it descends to a line bundle Tk+1(L) on the symmetric product Ck+1 via the quotient map q:Ck+1Ck+1. We have qTk+1(L)=p1Lpk+1L. Define a divisor δk+1 on Ck+1 such that the associated line bundle OCk+1(δk+1)=det(σk+1,(OCk×C)). Let

    Ak+1,L:=Tk+1(L)(2δk+1)

    be a line bundle on Ck+1. When k=0, we use the convention that T1(L)=E1,L=L and δ1=0.

    The main ingredient in the proof of Theorem 1.1 is to study the positivity of the line bundle Ak+1,L. Some partial results and their geometric consequences have been discussed in [2,Lemma 5.12 and Proposition 5.13]. Along this direction, we establish the following proposition to give a full picture in a general result describing the positivity of the line bundle Ak+1,L. This may be of independent interest.

    Proposition 1.2. Let C be a nonsingular projective curve of genus g, and L be a line bundle on C. If degL2g+2k+ for integers k,0, then the line bundle Ak+1,L on Ck+1 separates +1 points.

    In particular, if degL2g+2k, then Ak+1,L is globally generated, and if degL2g+2k+1, then Ak+1,L is very ample.

    In this section, we prove Theorem 1.1. We begin with showing Proposition 1.2.

    Proof of Proposition 1.2. We proceed by induction on k and . If k=0, then A1,L=L and degL2g+. It immediately follows from Riemann–Roch that L separates +1 points. If =0, then degL2g+2k. By [2,Lemma 5.12], Ak+1,L separates 1 point.

    Assume that k1 and 1. Let z be a length +1 zero-dimensional subscheme of Ck+1. We aim to show that the natural restriction map

    rz,k+1,L:H0(Ck+1,Ak+1,L)H0(z,Ak+1,L|z)

    is surjective. We can choose a point pC such that Xp contains a point in the support of z, where Xp is the divisor on Ck+1 defined by the image of the morphism CkCk+1 sending ξ to ξ+p. Let y:=zXp be the scheme-theoretic intersection, and Ix:=(Iz:IXp), which defines a subscheme x of z in Ck+1, where Iz and IXp are ideal sheaves of z and Xp in Ck+1, respectively. We have the following commutative diagram

    rz,k+1,L:H0(Ck+1,Ak+1,L)H0(z,Ak+1,L|z)

    where all rows and columns are short exact sequences. By tensoring with Ak+1,L and taking the global sections of last two rows, we obtain the commutative diagram with exact sequences

    rz,k+1,L:H0(Ck+1,Ak+1,L)H0(z,Ak+1,L|z)

    in which we use the fact that H1(Ak+1,L(Xp))=0 (see the proof of [2,Lemma 5.12]). Note that Ak+1,L(Xp)=Ak+1,L(p) and Ak+1,L|XpAk,L(2p), where we identify Xp=Ck.

    Since length(y)length(z)=+1 and degL(2p)2g+2(k1)+, the induction hypothesis on k implies that ry,k,L(2p) is surjective. On the other hand, if x=, which means that z is a subscheme of Xp, then trivially rx,k+1,L(p) is surjective. Otherwise, suppose that x. By the choice of Xp, we know that y is not empty, and therefore, we have length(x)length(z)1=. Now, degL(p)2g+2k+(1), so the induction hypothesis on implies that L(p) separates points. In particular, rx,k+1,L(p) is surjective. Hence rz,k+1,L is surjective as desired.

    Lemma 2.1. Let φ:XY be a finite surjective morphism between two varieties. If φ1(q) is scheme theoretically a reduced point for each closed point qY, then φ is an isomorphism.

    Proof. Note that φ is proper, injective, and unramifield. Then it is indeed a classical result that φ is an isomorphism. Here we give a short proof for reader's convenience. The problem is local. We may assume that X=SpecB and Y=SpecA for some rings A,B. We may regard A as a subring of B. For any qY, let p:=φ1(q)X. It is enough to show that the localizations A:=Amq and B:=Bmp are isomorphic. Let mq,mp be the maximal ideals of the local rings A,B, respectively. The assumption says that mqB=mp. We have

    B/AAA/mq=B/(mqB+A)=B/(mp+A)=0.

    By Nakayama lemma, we obtain B/A=0.

    We keep using the notations used in the introduction. Recall that C is a nonsingular projective curve of genus g0, and L is a very ample line bundle on C. Consider ξkCk and xC, and let ξ:=ξk+xCk+1. The divisor ξk spans a k-secant (k1)-plane P(H0(ξk,L|ξk)) to C in P(H0(C,L)), and it is naturally embedded in the (k+1)-secant k-plane P(H0(ξ,L|ξ)) spanned by ξ. This observation naturally induces a morphism

    αk,1:Bk1(L)×CBk(L).

    To see it in details, we refer to [1,p.432,line –5]. We define the relative secant variety Z=Zk1 of (k1)-planes in Bk(L) to be the image of the morphism αk,1. The relative secant variety Z is a divisor in the secant bundle Bk(L), and it is the preimage of (k1)-th secant variety Σk1 under the morphism βk. It plays the role of transferring the codimension two situation (Σk,Σk1) into the codimension one situation (Bk(L),Z). We collect several properties of Z.

    Proposition 2.2. ([2,Proposition 3.15,Theorem 5.2,and Proposition 5.13]) Recall the situation described in the diagram

    αk,1:Bk1(L)×CBk(L).

    Let H be the pull back of a hyperplane divisor of Pr by βk, and let IΣk1|Σk be the ideal sheaf on Σk defining the subvariety Σk1. Then one has

    1. OBk(L)((k+1)HZ)=πkAk+1,L.

    2. Riβk,OBk(L)(Z)={IΣk1|Σkifi=00ifi>0.

    3. IΣk1|ΣkOBk(L)=OBk(L)(Z).

    As a direct consequence of the above proposition, we have an identification

    H0(Ck+1,Ak+1,L)=H0(Σk,IΣk1|Σk(k+1)).

    We are now ready to give the proof of Theorem 1.1.

    Proof of Theorem 1.1. Let

    b:˜Σk:=BlΣk1ΣkΣk

    be the blowup of Σk along Σk1 with exceptional divisor E. As IΣk1|ΣkOBk(L)=OBk(L)(Z) (see Proposition 2.2), there exists a morphism α from Bk(L) to the blowup ˜Σk fitting into the following commutative diagram

    b:˜Σk:=BlΣk1ΣkΣk

    We shall show that α is an isomorphism.

    Write V:=H0(Σk,IΣk1|Σk(k+1)). As proved in [2,Theorem 5.2], IΣk1|Σk(k+1) is globally generated by V. This particularly implies that on the blowup ˜Σk one has a surjective morphism VO˜ΣkbOΣk(k+1)(E), which induces a morphism

    γ:˜ΣkP(V).

    On the other hand, one has an identification V=H0(Ck+1,Ak+1,L) by Proposition 2.2. Recall from Proposition 1.2 that Ak+1,L is very ample. So the complete linear system |V|=|Ak+1,L| on Ck+1 induces an embedding

    ψ:Ck+1P(V).

    Also note that α(bOΣk(k+1)(E))=βkOΣk(k+1)(Z)=πkAk+1,L by Proposition 2.2. Hence we obtain the following commutative diagram

    ψ:Ck+1P(V).

    Take an arbitrary closed point x˜Σk, and consider its image x:=b(x) on Σk. There is a nonnegative integer mk such that xΣmΣm1Σk. In addition, the point x uniquely determines a degree m+1 divisor ξm+1,x on C in such a way that ξm+1,x=ΛC, where Λ is a unique (m+1)-secant m-plane to C with xΛ (see [2,Definition 3.12]). By [2,Proposition 3.13], β1k(x)Ckm and πk(β1k(x))=ξm+1,x+CkmCk+1. Consider also x:=γ(x) which lies in the image of ψ. As ψ is an embedding, we may think x as a point of Ck+1. Now, through forming fiber products, we see scheme-theoretically

    α1(x)π1k(x)β1k(x).

    However, the restriction of the morphism πk on β1k(x) gives an embedding of Ckm into Ck+1. This suggests that π1k(x)β1k(x) is indeed a single reduced point, and so is α1(x). Finally by Lemma 2.1, α is an isomorphism as desired.



    [1] Y. Li, Q. Liu, A comprehensive review study of cyber-attacks and cyber security, Emerging trends and recent developments, Energy Rep., 7 (2021), 8176–8186. https://doi.org/10.1016/j.egyr.2021.08.126 doi: 10.1016/j.egyr.2021.08.126
    [2] S. Chng, H. Y. Lu, A. Kumar, D. Yau, Hacker types, motivations and strategies: A comprehensive framework, Comput. Hum. Behav. Rep., 5 (2022), 100167. https://doi.org/10.1016/j.chbr.2022.100167 doi: 10.1016/j.chbr.2022.100167
    [3] M. Grobler, R. Gaire, S. Nepal, User, usage and usability: Redefining human centric cyber security, Front. Big Data, 4 (2021). https://doi.org/10.3389/fdata.2021.583723
    [4] A. A. Moustafa, A. Bello, The role of user behaviour in improving cyber security management, Front. Psychol., 12 (2021). https://doi.org/10.3389/fpsyg.2021.561011
    [5] J. Wang, H. Li, Surpassing the fractional derivative: Concept of the memory dependent derivative, Comput. Math. Appl., 62 (2011), 1562–1567. https://doi.org/10.1016/j.camwa.2011.04.028 doi: 10.1016/j.camwa.2011.04.028
    [6] L. Zanette, A. White, A. C. Allen, M. Clinchy, Perceived predation risk reduces the number of offspring songbirds produce per year, Science, 334 (2011), 1398–1401. https://dx.doi.org/10.1126/science.1210908 doi: 10.1126/science.1210908
    [7] L. Y. Zanette, M. Clinchy, Ecology of fear, Curr. Biol., 29 (2019), 309–313. https://doi.org/10.1016/j.cub.2019.02.042
    [8] J. P. Tripathi, P. S. Mandal, A. Poonia, V. P. Bajiya, A widespread interaction between generalist and specialist enemies: The role of intraguild predation and allee effect, Appl. Math. Model., 89 (2021), 105–135. https://doi.org/10.1016/j.apm.2020.06.074 doi: 10.1016/j.apm.2020.06.074
    [9] R. K. Upadhyay, Chaotic dynamics in a three species aquatic population model with holling type Ⅱ functional response, Nonlinear Anal-Model., 13 (2008), 103–115. https://doi.org/10.15388/NA.2008.13.1.14592 doi: 10.15388/NA.2008.13.1.14592
    [10] R. K. Upadhyay, R. D. Parshad, K. Antwi-Fordjour, E. Quansah, S. Kumari, Global dynamics of stochastic predator–prey model with mutual interference and prey defense, J. Appl. Math. Comput., 60 (2019), 169–190. https://doi.org/10.1007/s12190-018-1207-7 doi: 10.1007/s12190-018-1207-7
    [11] S. Kim, K. Antwi-Fordjour, Prey group defense to predator aggregated induced fear, Eur. Phys. J. Plus, 137 (2022), 1–17. https://doi.org/10.1140/epjp/s13360-022-02926-x doi: 10.1140/epjp/s13360-022-02926-x
    [12] A. A. Kilbas, H. M. Srivastava, J. J. Trujillo, Theory and Applications of Fractional Differential Equations, Elsevier, 2006.
    [13] B. Ross, Fractional Calculus and Its Applications, Proceedings of the International Conference held at the University of New Haven, Springer, 2014.
    [14] A. Atangana, New fractional derivatives with nonlocal and non-singular kernel: Theory and application to heat transfer model, Therm. Sci., 20 (2016), 763–769. https://doi.org/10.2298/TSCI160111018A doi: 10.2298/TSCI160111018A
    [15] M. Caputo, M. Fabrizio, A new definition of fractional derivative without singular Kernel, Progr. Fract. Differ. Appl., 1 (2015), 73–85. https://doi.org/10.12785/pfda/010201 doi: 10.12785/pfda/010201
    [16] M. K. Naik, C. Baishya, P. Veeresha, D. Baleanu, Design of a fractional-order atmospheric model via a class of ACT-like chaotic system and its sliding mode chaos control, Chaos, 33 (2023). https://doi.org/10.1063/5.0130403
    [17] R. N. Premakumari, C. Baishya, M. Sajid, M. K. Naik, Modeling the dynamics of a marine system using the fractional order approach to assess its susceptibility to global warming, Results Nonlinear Anal., 7 (2024), 89–109.
    [18] S. N Raw, P. Mishra, B. P. Sarangi, B. Tiwari, Appearance of temporal and spatial chaos in an ecological system: A mathematical modeling study, Iranian Journal of Science and Technology, Transactions A: Science, 45 (2021) 1417–1436. https://doi.org/10.1007/s40995-021-01139-8
    [19] S. Gao, H. Lu, M. Wang, D. Jiang, A. A. Abd El-Latif, R. Wu, et al., Design, hardware implementation, and application in video encryption of the 2D memristive cubic map, IEEE Int. Things, 11 (2024). https://doi.org/10.1109/JIOT.2024.3376572
    [20] S. Gao, R. Wu, X. Wang, J. iu, Q. Li, X. Tang, EFR-CSTP: Encryption for face recognition based on the chaos and semi-tensor product theory, Inf. Sci., 621 (2023) 766–781. https://doi.org/10.1016/j.ins.2022.11.121
    [21] N. Malleson, A. Evans, Agent-based models to predict crime at places, Encyclopedia of Criminology Criminal Justice, 12 (2013) 41–48. https://doi.org/10.1007/978-1-4614-5690-2_208
    [22] M. K. Naik, C. Baishya, P. Veeresha, A chaos control strategy for the fractional 3D Lotka- Volterra like attractor, Math. Comput. Simul., 211 (2023), 1–22. https://doi.org/10.1016/j.matcom.2023.04.001 doi: 10.1016/j.matcom.2023.04.001
    [23] T. Bosse, C. Gerritsen, M. Hoogendoorn, S. W. Jaffry, J. Treur, Agent-based vs. population-based simulation of displacement of crime: A comparative study, Web Intelligence and Agent Systems: An International Journal, 9 (2011), 147–160. https://dx.doi.org/10.3233/WIA-2011-0212 doi: 10.3233/WIA-2011-0212
    [24] P. A. Jones, P. J. Brantingham, L. R. Chayes, Statistical models of criminal behavior: The effects of law enforcement actions, Math. Mod. Meth. Appl. S., 20 (2010), 1397–1423. https://doi.org/10.1142/S0218202510004647 doi: 10.1142/S0218202510004647
    [25] S. Gao, R. Wu, X. Wang, J. Liu, Q. Li, X. Tang, Asynchronous updating Boolean network encryption algorithm, IEEE T. Circ. Syst. Vid., (2023). https://dx.doi.org/10.1109/TCSVT.2023.3237136
    [26] S. Gao, H. H. Iu, J. Mou, U. Erkan, J. Liu, R Wu, et al., Temporal action segmentation for video encryption, Chaos, Soliton. Fract., 183 (2024), 114958. https://doi.org/10.1016/j.chaos.2024.114958 doi: 10.1016/j.chaos.2024.114958
    [27] S. Raw, B. Mishra, B. Tiwari, Mathematical study about a predator–prey model with antipredator behavior, Int. J. Appl. Comput. Math., 6 (2020), 1–22. https://doi.org/10.1007/s40819-020-00822-5 doi: 10.1007/s40819-020-00822-5
    [28] K. Diethelm, N. J. Ford, A. D. Freed, A Predictor-Corrector approach for the numerical solution of fractional differential equations, Nonlinear Dynam., 29 (2002) 3–22. https://doi.org/10.1023/A: 1016592219341
    [29] I. Podlubny, Fractional Differential Equations, Elsevier, 1999.
    [30] X. Wang, Y. j. He, M. j. Wang, Chaos control of a fractional order modified coupled dynamos system, Nonlinear Anal-Theory, 71 (2009), 6126–6134. https://doi.org/10.1016/j.na.2009.06.065 doi: 10.1016/j.na.2009.06.065
    [31] H. Li, L. Zhang, C. Hu, Y. Jiang, Z. Teng, Dynamical analysis of a fractional-order predatorprey model incorporating a prey refuge, J. Appl. Math. Comput., 54 (2017), 435–449. https://doi.org/10.1007/s12190-016-1017-8 doi: 10.1007/s12190-016-1017-8
    [32] E. Ahmed, A. S. Elgazzar, On fractional order differential equations model for nonlocal epidemics, Physica A., 379 (2007), 607–614. https://doi.org/10.1016/j.physa.2007.01.010 doi: 10.1016/j.physa.2007.01.010
    [33] N. Sene, Introduction to the fractional-order chaotic system under fractional operator in Caputo sense, Alex. Eng. J., 60 (2021), 3997–4014. https://doi.org/10.1016/j.aej.2021.02.056 doi: 10.1016/j.aej.2021.02.056
    [34] C. Baishya, M. K. Naik, R. N. Premakumari, Design and implementation of a sliding mode controller and adaptive sliding mode controller for a novel fractional chaotic class of equations, Results Control Optim., 14 (2024). https://doi.org/10.1016/j.rico.2023.100338
    [35] M. Sandri, Numerical calculation of Lyapunov exponents, Math. J., 6 (1996), 78–84.
    [36] A. Sharp, J. Pastor, Stable limit cycles and the paradox of enrichment in a model of chronic wasting disease, Ecolog. Appl., 21 (2011), 1024–1030. https://doi.org/10.1890/10-1449.1 doi: 10.1890/10-1449.1
    [37] E. Gonzalez-Olivares, H. Meneses-Alcay, B. Gonzalez-Yanez, J. Mena-Lorca, A. Rojas-Palma, R. Ramos-Jiliberto, Multiple stability and uniqueness of the limit cycle in a Gause-type predator-prey model considering the Allee effect on prey, Nonlinear Anal-Real, 12 (2011), 2931–2942. https://doi.org/10.1016/j.nonrwa.2011.04.003 doi: 10.1016/j.nonrwa.2011.04.003
    [38] G. Williams, Chaos Theory Tamed, CRC press, 1997.
  • Reader Comments
  • © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1047) PDF downloads(77) Cited by(3)

Figures and Tables

Figures(9)  /  Tables(4)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog