<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OJAppS</journal-id><journal-title-group><journal-title>Open Journal of Applied Sciences</journal-title></journal-title-group><issn pub-type="epub">2165-3917</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ojapps.2023.133032</article-id><article-id pub-id-type="publisher-id">OJAppS-123900</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Biomedical&amp;Life Sciences</subject><subject> Chemistry&amp;Materials Science</subject><subject> Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Dynamical Behavior of Discrete Ratio-Dependent Predator-Prey System
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mingxia</surname><given-names>Duan</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Jiying</surname><given-names>Ma</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>College of Science, University of Shanghai for Science and Technology, Shanghai, China</addr-line></aff><aff id="aff1"><addr-line>Department of Mathematics, University of Shanghai for Science and Technology, Shanghai, China</addr-line></aff><pub-date pub-type="epub"><day>02</day><month>03</month><year>2023</year></pub-date><volume>13</volume><issue>03</issue><fpage>396</fpage><lpage>413</lpage><history><date date-type="received"><day>22,</day>	<month>February</month>	<year>2023</year></date><date date-type="rev-recd"><day>25,</day>	<month>March</month>	<year>2023</year>	</date><date date-type="accepted"><day>28,</day>	<month>March</month>	<year>2023</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution-NonCommercial International License (CC BY-NC).http://creativecommons.org/licenses/by-nc/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this paper, we propose a discrete ratio-dependent predator-prey system. The stability of the fixed points of this model is studied. At the same time, it is shown that the discrete model undergoes fold bifurcation and flip bifurcation by using bifurcation theory and the method of approximation by a flow. Numerical simulations are presented not only to demonstrate the consistence with our theoretical analyses, but also to exhibit the complex dynamical behaviors, such as the cascade of period-doubling bifurcation in period-2 and the chaotic sets. The Maximum Lyapunov exponents are numerically computed to confirm further the complexity of the dynamical behaviors. These results show that the direct discrete method has more rich dynamic behaviors than the discrete model obtained by Euler method.
 
</p></abstract><kwd-group><kwd>Discrete-Time Predator-Prey System</kwd><kwd> Ratio-Dependent Functional Response</kwd><kwd> Stability and Bifurcation Analysis</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction and Preliminaries</title><p>The interaction between predators and their prey has long been the studied topics of ecology and mathematical ecology. In recent years, discrete dynamic models have been widely studied. Compared with continuous dynamic systems, discrete dynamic systems have the following three advantages: Firstly, when populations have non-overlapping generations or the population number is small, discrete dynamic systems are more appropriate than continuous dynamic systems. Secondly, the numerical simulation results obtained from the discrete dynamic system are more accurate than the continuous dynamic system. Thirdly, discrete models exhibit more complex dynamic characteristics than corresponding continuous models [<xref ref-type="bibr" rid="scirp.123900-ref1">1</xref>]. For example, the single-species discrete Logistic model has more complex dynamic behaviors such as bifurcation and chaos.</p><p>There are two ways to get discrete system. On the one hand, we start from the continuous model and transform the continuous model into a discrete model by some method, such as Euler iteration [<xref ref-type="bibr" rid="scirp.123900-ref2">2</xref>] and semi-discrete methods [<xref ref-type="bibr" rid="scirp.123900-ref3">3</xref>]. On the other hand, we start from the discrete model directly. Elettreby [<xref ref-type="bibr" rid="scirp.123900-ref4">4</xref>] [<xref ref-type="bibr" rid="scirp.123900-ref5">5</xref>] studied the discrete prey-predator model with mixed functional response from the following discrete model.</p><p>{ x ( n + 1 ) = x ( n ) ( a − b x ( n ) ) − p ( x ( n ) ) y ( n ) , y ( n + 1 ) = q ( x ( n ) ) y ( n ) − d y ( n ) , (1.1)</p><p>where x ( n ) and y ( n ) represent population densities of prey and predator at a discrete time step n, respectively; d is the natural death rate of the predator; p ( x ( n ) ) y ( n ) and q ( x ( n ) ) y ( n ) represent the predator-prey interaction, p ( x ( n ) ) is the predator functional responses, q ( x ( n ) ) describes how predator transforms the consumed prey into the growth of predator. Because the function p ( x ( n ) ) only depends on the density of prey, it is often called a prey-dependent response function. However, more and more evidence shows that in many situations, especially when predators have to search for food, a more appropriate functional response is a function which is dependent on both prey and predator densities.</p><p>Differing from the prey-dependent predator-prey systems, the ratio-dependent predator-prey models have two main predictions: a) the equilibrium abundance is positively correlated with the enrichment gradient (see Arditi [<xref ref-type="bibr" rid="scirp.123900-ref6">6</xref>] ) and b) the “paradox of enrichment” (see Rosenzweig [<xref ref-type="bibr" rid="scirp.123900-ref7">7</xref>] ) either completely disappears or enrichment is linked to stability in a more complex way. In this paper, we will study some mathematical characteristic rather than discuss the ecological significance of the model. In 2001, Xiao [<xref ref-type="bibr" rid="scirp.123900-ref8">8</xref>] [<xref ref-type="bibr" rid="scirp.123900-ref9">9</xref>] [<xref ref-type="bibr" rid="scirp.123900-ref10">10</xref>] further studied the ratio-dependent predator-prey model based on Kuang [<xref ref-type="bibr" rid="scirp.123900-ref11">11</xref>]. Xiao made a global qualitative analysis of the model depending on all parameters, and gave the conditions for the existence and nonexistence of limit cycles in the model. Later, the discrete-time dynamical models described by difference equations are widely investigated. Chen [<xref ref-type="bibr" rid="scirp.123900-ref3">3</xref>] showed that positive equilibrium is globally asymptotically stable and established a new sufficient condition. Sohel Rana [<xref ref-type="bibr" rid="scirp.123900-ref12">12</xref>] discretized the continuous model using the forward Euler scheme. It showed that under some parametric conditions, the system undergoes flip and Neimark-Sacker bifurcation.</p><p>Arditi [<xref ref-type="bibr" rid="scirp.123900-ref6">6</xref>] proposed the ratio-dependent function in the following form</p><p>p ( x y ) = c x y m + x y = c x m y + x .</p><p>Then we get the following discrete predator-prey model with the ratio-dependent:</p><p>{ x ( n + 1 ) = x ( n ) ( a − b x ( n ) ) − c x ( n ) y ( n ) x ( n ) + m y ( n ) , y ( n + 1 ) = y ( n ) ( − d + f x ( n ) x ( n ) + m y ( n ) ) , (1.2)</p><p>where a b &gt; 0 is the carrying capacity of the prey, d is the natural death rate of the predator, a is prey intrinsic growth rate, c is capturing rate, m is half saturation constant and f is conversion rate. So a, b, c, d, m and f are positive constants.</p><p>The paper is organized as follows. In Section 1, as preliminaries, an important lemma is given. In Section 2, we devote to the existence and local stability of the fixed points of system (1.2). In Sections 3 - 4, we analyze the bifurcation of system (1.2) at the boundary equilibrium point by using the bifurcation theory. Moreover, we proved that the system (1.2) undergoes fold and flip bifurcations for some parameters, respectively. In Section 5, numerical simulations are performed to illustrate the obtained theoretical results and reveal some new dynamical properties of the system (1.2). In Section 6, some conclusions close the paper.</p><p>Before analyzing the fixed points of the system (1.2), we introduce an important lemma [<xref ref-type="bibr" rid="scirp.123900-ref2">2</xref>], which will be useful later.</p><p>Lemma 1.1 Let F ( λ ) = λ 2 + B λ + C , where B and C are two real constants. Suppose λ 1 and λ 2 are two roots of F ( λ ) = 0 . Then the following statements hold. If F ( 1 ) &gt; 0 , then</p><p>1) | λ 1 | &lt; 1 and | λ 2 | &lt; 1 if and only if F ( − 1 ) &gt; 0 and C &lt; 1 ;</p><p>2) | λ 1 | &lt; 1 and | λ 2 | &gt; 1 (or | λ 1 | &gt; 1 and | λ 2 | &lt; 1 ) if and only if F ( − 1 ) &lt; 0 ;</p><p>3) | λ 1 | &gt; 1 and | λ 2 | &gt; 1 if and only if F ( − 1 ) &gt; 0 and C &gt; 1 ;</p><p>4) λ 1 = − 1 and | λ 2 | ≠ 1 if and only if F ( − 1 ) = 0 and B ≠ 0,2 ;</p><p>5) λ 1 = − 1 and λ 2 = − 1 if and only if F ( − 1 ) = 0 and B = 2 ;</p><p>6) | λ 1 | and | λ 2 | are a pair of conjugate complex roots and | λ 1 | = | λ 2 | = 1 if and only if − 2 &lt; B &lt; 2 and C = 1 .</p></sec><sec id="s2"><title>2. The Existence and Stability of Fixed Points</title><p>In this section, we give the conditions for existence of fixed points of system (1.2) in R + 2 and discuss the property of these fixed points.</p><p>It is clear that the fixed points of the system (1.2) satisfy the following equations:</p><p>{ x = x ( a − b x ) − c x y x + m y , y = y ( − d + f x x + m y ) . (2.1)</p><p>By a simple computation, we have</p><p>Lemma 2.1 System (1.2) has two fixed points:</p><p>(i) the boundary equilibrium point E 1 ( a − 1 b ,0 ) exists if a ≠ 1 ;</p><p>(ii) the unique positive fixed point E 2 ( x * , y * ) , where x * = a − 1 b − c ( f − d − 1 ) m b f and y * = f − d − 1 ( d + 1 ) m x * . The fixed point exists if and only if any one of the following conditions holds:</p><p>(ii.1) d + 1 &lt; f and c ≤ m ( a − 1 ) ;</p><p>(ii.2) d + 1 &lt; f &lt; c ( d + 1 ) c − m ( a − 1 ) and c &gt; m ( a − 1 ) .</p><p>Next, we study the stability of the system (1.2) at fixed points. The Jacobian matrix of the system (1.2) evaluated at E ( x , y ) is as follows:</p><p>J ( x , y ) = ( a − 2 b x − c m y 2 ( x + m y ) 2 − c x 2 ( x + m y ) 2 f m y 2 ( x + m y ) 2 − d + f x 2 ( x + m y ) 2 ) . (2.2)</p><p>The characteristic equation of the matrix can be written as</p><p>λ 2 + p ( x , y ) λ + q ( x , y ) = 0 ,</p><p>where</p><p>p ( x , y ) = d − a + 2 b x + c m y 2 − f x 2 ( x + m y ) 2 ,</p><p>q ( x , y ) = − a d + 2 b d x + a f x 2 + c m d y 2 − 2 b f x 3 ( x + m y ) 2 .</p><p>Proposition 2.2 When a ≠ 1 , system (1.2) has a boundary equilibrium point E 1 ( a − 1 b ,0 ) and</p><p>(i) it is a sink if 1 &lt; a &lt; 3 and d − 1 &lt; f &lt; d + 1 ;</p><p>(ii) it is a source if one of the following conditions holds:</p><p>(ii.1) 0 &lt; a &lt; 1 and 0 &lt; f &lt; d − 1 ;</p><p>(ii.2) 0 &lt; a &lt; 1 and f &gt; d + 1 ;</p><p>(ii.3) a &gt; 3 and 0 &lt; f &lt; d − 1 ;</p><p>(ii.4) a &gt; 3 and f &gt; d + 1 ;</p><p>(iii) it is non-hyperbolic if a = 3 or f = d − 1 or f = d + 1 ;</p><p>(iv) it is a saddle except if conditions (1)-(3) are satisfied.</p><p>Proof. The Jacobian matrix of the fixed point E 1 is</p><p>J | E 1 = ( 2 − a − c 0 f − d ) . (2.3)</p><p>The two eigenvalues of the characteristic equation are:</p><p>λ 1 = 2 − a ;   λ 2 = f − d .</p><p>Then, the fixed point ( a − 1 b ,0 ) is a sink if | λ i | &lt; 1 , where i = 1 , 2 .</p><p>| λ 1 | = | 2 − a | &lt; 1     then     1 &lt; a &lt; 3 ,</p><p>| λ 2 | = | f − d | &lt; 1     then   d − 1 &lt; f &lt; d + 1.</p><p>So, the fixed point E 1 ( a − 1 b ,0 ) is stable if the following condition are satisfied:</p><p>1 &lt; a &lt; 3 ,   d − 1 &lt; f &lt; d + 1.</p><p>The other three items of the propositions are proved by using the above method.</p><p>Condition (iii) can be written as</p><p>F B E 1 1 = { ( a , b , c , d , m , f ) ∈ ( 0 , + ∞ ) : f = d + 1 , a ≠ 3 , a ≠ 1 } , (2.4)</p><p>F B E 1 2 = { ( a , b , c , d , m , f ) ∈ ( 0 , + ∞ ) : f = d − 1 , a ≠ 3 , a ≠ 1 } , (2.5)</p><p>F B E 1 3 = { ( a , b , c , d , m , f ) ∈ ( 0 , + ∞ ) : a = 3 , a ≠ 1 , f ≠ d &#177; 1 } . (2.6)</p><p>For simple calculation, we denote R 1 = 2 + c m + m f 2 − c ( d + 1 ) 2 ( f − d − 2 ) m f [ d f − ( d + 1 ) 2 ] and R 2 = 3 + c m − c ( d + 1 ) 2 ( f − d − 3 ) m f [ ( d − 1 ) f − ( d + 1 ) 2 ] .</p><p>Proposition 2.3. When f &gt; d + 1 and a &gt; 1 + c ( f − d − 1 ) m f , system (1.2) has a unique positive fixed point E 2 ( x * , y * ) and</p><p>(i) it is a sink if one of the following conditions holds:</p><p>(i.1) d ≥ 1 , f &lt; ( d + 1 ) 2 d and R 1 &lt; a &lt; R 2 ;</p><p>(i.2) d ≥ 1 , f = ( d + 1 ) 2 d , m &gt; c d ( d + 1 ) 2 and a &lt; R 2 ;</p><p>(i.3) 0 &lt; d &lt; 1 , f &gt; ( d + 1 ) 2 d − 1 and a &lt; min { R 1 , R 2 } ;</p><p>(i.4) d = 1 , f &gt; ( d + 1 ) 2 d and a &lt; min { R 1 , R 2 } ;</p><p>(i.5) d &gt; 1 , ( d + 1 ) 2 d &lt; f &lt; ( d + 1 ) 2 d − 1 and a &lt; min { R 1 , R 2 } ;</p><p>(i.6) d &gt; 1 , f = ( d + 1 ) 2 d − 1 and a &lt; R 1 ;</p><p>(i.7) d &gt; 1 , f &gt; ( d + 1 ) 2 d − 1 and R 2 &lt; a &lt; R 1 ;</p><p>(ii) it is a source if one of the following conditions holds:</p><p>(ii.1) d ≥ 1 , f &lt; ( d + 1 ) 2 d and a &lt; min { R 1 , R 2 } ;</p><p>(ii.2) d ≥ 1 , f = ( d + 1 ) 2 d , m &lt; c d ( d + 1 ) 2 and a &lt; R 2 ;</p><p>(ii.3) 0 &lt; d &lt; 1 , f &gt; ( d + 1 ) 2 d − 1 and R 1 &lt; a &lt; R 2 ;</p><p>(ii.4) d = 1 , f &gt; ( d + 1 ) 2 d and R 1 &lt; a &lt; R 2 ;</p><p>(ii.5) d &gt; 1 , ( d + 1 ) 2 d &lt; f &lt; ( d + 1 ) 2 d − 1 and R 1 &lt; a &lt; R 2 ;</p><p>(ii.6) d &gt; 1 , f = ( d + 1 ) 2 d − 1 and a &gt; R 1 ;</p><p>(ii.7) d &gt; 1 , f &gt; ( d + 1 ) 2 d − 1 and a &gt; max { R 1 , R 2 } ;</p><p>(iii) it is a saddle if one of the following conditions holds:</p><p>(iii.1) 0 &lt; d &lt; 1 , f &gt; ( d + 1 ) 2 d − 1 and a &gt; R 2 ;</p><p>(iii.2) d = 1 and a &gt; R 2 ;</p><p>(iii.3) d &gt; 1 , f &gt; ( d + 1 ) 2 d − 1 and a &lt; R 2 ;</p><p>(iii.4) d &gt; 1 , f &lt; ( d + 1 ) 2 d − 1 and a &gt; R 2 ;</p><p>(iv) it is a non-hyperbolic if one of the following conditions holds:</p><p>(iv.1) f = ( d + 1 ) 2 d , c = m f and 2 + 1 d &lt; a &lt; 6 + 1 d ;</p><p>(iv.2) f &gt; ( d + 1 ) 2 d and m f − 4 m d f 3 − 4 m ( d + 1 ) 2 f 2 ( d + 1 ) 2 ( f − d − 1 ) 2 &lt; c &lt; m f ;</p><p>(iv.3) f ≠ ( d + 1 ) 2 d − 1 and a = R 2 .</p><p>Proof. The Jacobian matrix of the fixed point E 2 is</p><p>J | E 2 = ( 1 − b x * + c x * y * ( x * + m y * ) 2 − c ( x * ) 2 ( x * + m y * ) 2 f m ( y * ) 2 ( x * + m y * ) 2 1 − m f x * y * ( x * + m y * ) 2 ) . (2.7)</p><p>By computation, we have the characteristic equation of J ( x * , y * ) are follows:</p><p>λ 2 + B ( x * , y * ) λ + C ( x * , y * ) = 0 ,</p><p>where B ( x * , y * ) = − 2 + b x * − ( c − m f ) x * y * ( x * + m y * ) 2 , C ( x * , y * ) = 1 − b x * + ( c − m f ) x * y * ( x * + m y * ) 2 + b m f ( x * ) 2 y * ( x * + m y * ) 2 , x * = c ( d + 1 − f ) + m f ( a − 1 ) m b f and y * = f − d − 1 ( d + 1 ) m x * .</p><p>Let</p><p>F ( λ ) = λ 2 + B ( x * , y * ) λ + C ( x * , y * ) .</p><p>Obviously, F ( 1 ) = b m f ( x * ) 2 y * ( x * + m y * ) 2 &gt; 0 ,</p><p>F ( − 1 ) = ( a − 3 ) [ ( d − 1 ) f − ( d + 1 ) 2 ] f − c [ ( d − 1 ) f − ( d + 1 ) 2 ] m f   + c ( d + 1 ) 2 ( f − d − 3 ) m f 2 , (2.8)</p><p>C = a [ d f − ( d + 1 ) 2 ] f − 2 [ d f − ( d + 1 ) 2 ] f − c [ d f − ( d + 1 ) 2 ] f   + c ( d + 1 ) 2 ( f − d − 2 ) m f 2 , (2.9)</p><p>B = a + d − 2 − c m − ( d + 1 ) 2 f + c ( d + 1 ) 2 m f 2 . (2.10)</p><p>From Lemma 1.1, we can see that both | λ 1 | &lt; 1 and | λ 2 | &lt; 1 if and only if F ( − 1 ) &gt; 0 and C &lt; 1 . Then</p><p>F ( − 1 ) &gt; 0 ⇒ [ ( d − 1 ) f − ( d + 1 ) 2 ] m f a &gt; 3 [ ( d − 1 ) f − ( d + 1 ) 2 ] m f                                       + [ ( d − 1 ) f − ( d + 1 ) 2 ] c f − c ( d + 1 ) 2 ( f − d − 3 ) .</p><p>If ( d − 1 ) f − ( d + 1 ) 2 &gt; 0 , then d &gt; 1 , f &gt; ( d + 1 ) 2 d − 1 and a &gt; R 2 ;</p><p>If ( d − 1 ) f − ( d + 1 ) 2 = 0 , then f = ( d + 1 ) 2 d − 1 and d &gt; 1 ;</p><p>If ( d − 1 ) f − ( d + 1 ) 2 &lt; 0 , then we can divided d into there cases: d &gt; 1 , d = 1 and 0 &lt; d &lt; 1 .</p><p>Case I: if d &gt; 1 , then f &lt; ( d + 1 ) 2 d − 1 and a &lt; R 2 ;</p><p>Case II: if d = 1 , then a &lt; R 2 ;</p><p>Case III: if 0 &lt; d &lt; 1 , then f &gt; ( d + 1 ) 2 d − 1 and a &lt; R 2 .</p><p>C &lt; 1 ⇒ [ d f − ( d + 1 ) 2 ] m f a &lt; 2 [ d f − ( d + 1 ) 2 ] m f + [ d f − ( d + 1 ) 2 ] c f                         − c ( d + 1 ) 2 ( f − d − 2 ) + m f 2 .</p><p>If d f − ( d + 1 ) 2 &gt; 0 , then f &gt; ( d + 1 ) 2 d and a &lt; R 1 ;</p><p>If d f − ( d + 1 ) 2 = 0 , then f = ( d + 1 ) 2 d and m &gt; c d ( d + 1 ) 2 ;</p><p>If d f − ( d + 1 ) 2 &lt; 0 , then f &lt; ( d + 1 ) 2 d and a &gt; R 1 .</p><p>From F ( − 1 ) &gt; 0 and C &lt; 1 , we get conclusion (i). The propositions (ii) and (iii) are proved by using the above method.</p><p>Note that the fixed point E 2 ( x * , y * ) is non-hyperbolic if either | λ 1 | = 1 or | λ 2 | = 1 . There also are two cases: Δ &lt; 0 and Δ ≥ 0 . When Δ &lt; 0 , E 2 ( x * , y * ) is non-hyperbolic if and only if C = 1 and − 2 &lt; B &lt; 2 . Then</p><p>− 2 &lt; B &lt; 2 ⇒ − d + c m + ( d + 1 ) 2 f − c ( d + 1 ) 2 m f 2 &lt; a &lt; 4 − d + c m + ( d + 1 ) 2 f − c ( d + 1 ) 2 m f 2</p><p>C = 1 ⇒ [ d f − ( d + 1 ) 2 ] m f a − 2 [ d f − ( d + 1 ) 2 ] m f − [ d f − ( d + 1 ) 2 ] c f                         + c ( d + 1 ) 2 ( f − d − 2 ) = m f 2 .</p><p>If f = ( d + 1 ) 2 d , then c = m f ; If f ≠ ( d + 1 ) 2 d , then a = R 1 . From C = 1 and − 2 &lt; B &lt; 2 , we get conclusion (iv.1, 2).</p><p>When Δ ≥ 0 , E 2 ( x * , y * ) is non-hyperbolic if and only if F ( − 1 ) = 0 . Then</p><p>F ( − 1 ) = 0 ⇒ [ ( d − 1 ) f − ( d + 1 ) 2 ] m f a − 3 [ ( d − 1 ) f − ( d + 1 ) 2 ] m f                                       − [ ( d − 1 ) f − ( d + 1 ) 2 ] c f + c ( d + 1 ) 2 ( f − d − 3 ) = 0.</p><p>From Δ ≥ 0 and F ( − 1 ) = 0 , we get conclusion (iv.3). Thus, we finish the proof.</p></sec><sec id="s3"><title>3. Fold Bifurcation</title><p>From Proposition 2.2 (iii), we know that the eigenvalues at E 1 ( a − 1 b ,0 ) are λ 1 = 2 − a and λ 2 = 1 if both f = d + 1 and a ≠ 1,3 .</p><p>Let u ( n ) = x ( n ) − a − 1 b , v ( n ) = y ( n ) and f * = f − d − 1 . We transform the fixed pointed E 1 ( a − 1 b ,0 ) into the origin. After Taylor expansion, the system (1.2) becomes</p><p>( u ( n + 1 ) v ( n + 1 ) ) = ( 2 − a − c 0 1 ) ( u ( n ) v ( n ) ) + ( F 1 ( u ( n ) , v ( n ) , f * ) F 2 ( u ( n ) , v ( n ) , f * ) ) , (3.1)</p><p>where U = ( u ( n ) , v ( n ) ) T and</p><p>F 1 ( u ( n ) , v ( n ) , f * ) = − b u 2 ( n ) + b c m a − 1 v 2 ( n ) − b 2 c m ( a − 1 ) 2 u ( n ) v 2 ( n ) − b 2 c m 2 ( a − 1 ) 2 v 3 ( n ) + O ( ‖ U ‖ 4 ) ,</p><p>F 2 ( u ( n ) , v ( n ) , f * ) = f * v ( n ) − b m ( f * + d + 1 ) a − 1 v 2 ( n ) + b 2 m ( f * + d + 1 ) ( a − 1 ) 2 u ( n ) v 2 ( n )       + b 2 m 2 ( f * + d + 1 ) ( a − 1 ) 2 v 3 ( n ) + O ( ‖ U ‖ 4 ) .</p><p>When a ≠ 1,3 , we construct an invertible matrix</p><p>T 1 = ( 1 c 0 1 − a ) .</p><p>Let</p><p>( u ( n ) v ( n ) ) = T 1 ( x ˜ ( n ) y ˜ ( n ) ) .</p><p>Then system (3.1) can be transformed into</p><p>( x ˜ ( n + 1 ) y ˜ ( n + 1 ) ) = ( 2 − a 0 0 1 ) ( x ˜ ( n ) y ˜ ( n ) ) + ( g 1 ( x ˜ ( n ) , y ˜ ( n ) , f * ) g 2 ( x ˜ ( n ) , y ˜ ( n ) , f * ) ) , (3.2)</p><p>where</p><p>g 1 ( x ˜ ( n ) , y ˜ ( n ) , f * ) = − c f * y ˜ ( n ) + b 2 c m f * + d − a + 2 a − 1 x ˜ ( n ) y ˜ 2 ( n )       − b c [ c + m ( f * + d − a + 2 ) ] y ˜ 2 ( n ) − b x ˜ 2 ( n ) − 2 b c x ˜ ( n ) y ˜ ( n )       + [ b 2 c 2 m f * + d − a + 2 a − 1 − b 2 c m 2 ( f * + d − a + 2 ) ] y ˜ 3 ( n ) ,</p><p>g 2 ( x ˜ ( n ) , y ˜ ( n ) , f * ) = f * y ˜ ( n ) + b m ( f * + d + 1 ) y ˜ 2 ( n ) + b 2 m ( f * + d + 1 ) 1 − a x ˜ y ˜ 2 ( n )       + [ b 2 c m f * + d + 1 1 − a + b 2 m 2 ( f * + d + 1 ) ] y ˜ 3 ( n ) .</p><p>By the center manifold theorem and the method of the references [<xref ref-type="bibr" rid="scirp.123900-ref13">13</xref>], we know that there exists a center manifold M c ( 0 ) of system (3.2) at the origin in a small neighborhood of f * = 0 , which can be approximately represented as follows:</p><p>M c ( 0 ) = { ( x ˜ ( n ) , y ˜ ( n ) , f * ) ∈ R 3 | x ˜ ( n ) = h ( y ˜ ( n ) , f * ) , h ( 0 , 0 ) = 0 , D h ( 0 , 0 ) = 0 } .</p><p>For y ˜ ( n ) and f * sufficiently small, we assume that a center manifold of the form</p><p>h ( y ˜ ( n ) , f * ) = b 0 f * + b 1 f * y ˜ ( n ) + b 2 ( f * ) 2 + b 3 y ˜ 2 ( n ) + O ( ( | y ˜ ( n ) | + | f * | ) 3 ) ,</p><p>where O ( ( | y ˜ ( n ) | + | f * | ) 3 ) is a function with order at least three of its variables.</p><p>x ˜ ( n + 1 ) = h ( y ˜ ( n + 1 ) , f * ) = b 0 f * + b 1 f * y ˜ ( n ) + b 2 ( f * ) 2 + b 3 y ˜ 2 ( n ) + O ( ( | y ˜ ( n ) | + | f * | ) 3 ) . (3.3)</p><p>Also,</p><p>x ˜ ( n + 1 ) = ( 2 − a ) h ( y ˜ ( n ) , f * ) + g 1 ( h ( y ˜ ( n ) , f * ) , y ˜ ( n ) , f * ) = ( 2 − a ) b 0 f * + [ ( 2 − a ) b 1 − c − 2 b 0 b c ] f * y ˜ ( n )       + [ ( 2 − a ) b 2 − b b 0 2 ] ( f * ) 2 + [ ( 2 − a ) b 3 − b c 2 − m b c d   + m a b c − 2 m b c ] y ˜ 2 ( n ) + O ( ( | y ˜ ( n ) | + | f * | ) 3 ) . (3.4)</p><p>Compare the coefficients for (3.3) and (3.4), we have</p><p>b 0 = 0 ,   b 1 = c 1 − a ,   b 2 = 0 ,   b 3 = b c 2 + m b c d − m a b c + 2 m b c 1 − a .</p><p>System (3.2) restricted to the center manifold is given by</p><p>y ˜ ( n + 1 ) = ( 1 + f * ) y ˜ ( n ) + b m ( f * + d + 1 ) y ˜ 2 ( n ) + O ( ( | y ˜ ( n ) | + | f * | ) 3 ) . (3.5)</p><p>Let</p><p>F ( y ˜ ( n ) , f * ) = y ˜ ( n + 1 ) ,</p><p>then</p><p>∂ F ∂ y ˜ ( n ) | ( 0 , 0 ) = 1 + f * + 2 b m y ˜ ( n ) ( f * + d + 1 ) = 1 ,</p><p>∂ F ∂ f * | ( 0 , 0 ) = y ˜ ( n ) + b m y ˜ 2 ( n ) = 0 ,</p><p>∂ 2 F ∂ y ˜ ( n ) 2 | ( 0 , 0 ) = 2 b m ( f * + d + 1 ) = 2 b m ( d + 1 ) &gt; 0 ,</p><p>∂ 2 F ∂ y ˜ ( n ) ∂ f * | ( 0 , 0 ) = 1 + 2 b m y ˜ ( n ) = 1 ,   ∂ 2 F ∂ ( f * ) 2 | ( 0 , 0 ) = 0.</p><p>Theorem 3.1 System (1.2) undergoes a fold bifurcation at E 1 ( a − 1 b ,0 ) when parameter f varies in a small neighbourhood of F B E 1 1 .</p></sec><sec id="s4"><title>4. Flip Bifurcation</title><p>From Proposition 2.2 (iii), we know that the eigenvalues at E 1 ( a − 1 b ,0 ) are λ 1 = − 1 and λ 2 = f − d if both a = 3 and f − d ≠ &#177; 1 (similarly for the case of F B E 1 2 ).</p><p>Let u ( n ) = x ( n ) − a − 1 b , v ( n ) = y ( n ) and a * = a − 3 . We transform the fixed pointed E 1 ( a − 1 b ,0 ) into the origin. After Taylor expansion, the system (1.2) becomes</p><p>( u ( n + 1 ) v ( n + 1 ) ) = ( − 1 − c 0 f − d ) ( u ( n ) v ( n ) ) + ( F 1 ( u ( n ) , v ( n ) , a * ) F 2 ( u ( n ) , v ( n ) , a * ) ) , (4.1)</p><p>where U = ( u ( n ) , v ( n ) ) T and</p><p>F 1 ( u ( n ) , v ( n ) , a * ) = − a * u ( n ) − b u 2 ( n ) + b c m a * + 2 v 2 ( n ) − b 2 c m ( a * + 2 ) 2 u ( n ) v 2 ( n )       − b 2 c m 2 ( a * + 2 ) 2 v 3 ( n ) + O ( ‖ U ‖ 4 ) ,</p><p>F 2 ( u ( n ) , v ( n ) , a * ) = − b m f a * + 2 v 2 ( n ) + b 2 m f ( a * + 2 ) 2 u ( n ) v 2 ( n ) + b 2 m 2 f ( a * + 2 ) 2 v 3 ( n ) + O ( ‖ U ‖ 4 ) .</p><p>When f − d ≠ 1 , we construct an invertible matrix</p><p>T 2 = ( 1 − ( a * + 2 ) c 0 ( a * + 2 ) ( f − d + 1 ) ) .</p><p>Let</p><p>( u ( n ) v ( n ) ) = T 2 ( x ˜ ( n ) y ˜ ( n ) ) .</p><p>Then system (4.1) can be transformed into</p><p>( x ˜ ( n + 1 ) y ˜ ( n + 1 ) ) = ( − 1 0 0 f − d ) ( x ˜ ( n ) y ˜ ( n ) ) + ( g 1 ( x ˜ ( n ) , y ˜ ( n ) , a * ) g 2 ( x ˜ ( n ) , y ˜ ( n ) , a * ) ) , (4.2)</p><p>where</p><p>g 1 ( x ˜ ( n ) , y ˜ ( n ) , a * ) = − a * x ˜ ( n ) − b x ˜ 2 ( n ) + [ b c m ( a * + 2 ) ( 1 − d ) ( f − d + 1 ) − b c 2 ( a * + 2 ) 2 ] y ˜ 2 ( n )         + c a * ( a * + 2 ) y ˜ ( n ) + 2 b c ( a * + 2 ) x ˜ ( n ) y ˜ ( n )         + b 2 c m ( d − 1 ) ( f − d + 1 ) x ˜ ( n ) y ˜ 2 ( n )         + b 2 c m ( d − 1 ) ( a * + 2 ) ( f − d + 1 ) [ m ( f − d + 1 ) − c ] y ˜ 3 ( n ) ,</p><p>g 2 ( x ˜ ( n ) , y ˜ ( n ) , a * ) = − b m f ( f − d + 1 ) y ˜ 2 ( n ) + b 2 m f ( f − d + 1 ) a * + 2 x ˜ ( n ) y ˜ 2 ( n )         + b 2 m f ( f − d + 1 ) [ m ( f − d + 1 ) − c ] y ˜ 3 ( n ) .</p><p>By the center manifold theorem and the method of the references [<xref ref-type="bibr" rid="scirp.123900-ref13">13</xref>], we know that there exists a center manifold M c ( 0 ) of system (4.2) at the origin in a small neighborhood of a * = 0 , which can be approximately represented as follows:</p><p>M c ( 0 ) = { ( x ˜ ( n ) , y ˜ ( n ) , a * ) ∈ R 3 | y ˜ ( n ) = h ( x ˜ ( n ) , a * ) , h ( 0 , 0 ) = 0 , D h ( 0 , 0 ) = 0 } .</p><p>For x ˜ ( n ) and a * sufficiently small, we assume that a center manifold of the form</p><p>h ( x ˜ ( n ) , a * ) = b 0 a * + b 1 a * x ˜ ( n ) + b 2 ( a * ) 2 + b 3 x ˜ 2 ( n ) + O ( ( | x ˜ ( n ) | + | a * | ) 3 ) ,</p><p>where O ( ( | x ˜ ( n ) | + | a * | ) 3 ) is a function with order at least three of its variables.</p><p>y ˜ ( n + 1 ) = h ( x ˜ ( n + 1 ) , a * ) = b 0 a * − b 1 a * x ˜ ( n ) + b 2 ( a * ) 2 + b 3 x ˜ 2 ( n ) + O ( ( | x ˜ ( n ) | + | a * | ) 3 ) . (4.3)</p><p>Also,</p><p>y ˜ ( n + 1 ) = ( f − d ) h ( x ˜ ( n ) , a * ) + g 1 ( x ˜ ( n ) , h ( x ˜ ( n ) , a * ) , a * ) = ( f − d ) b 0 a * + ( f − d ) b 1 a * x ˜ ( n )       + [ ( f − d ) b 2 − b b 0 2 m f ( f − d + 1 ) ] ( a * ) 2       + b 3 ( f − d ) x ˜ 2 ( n ) + O ( ( | x ˜ ( n ) | + | a * | ) 3 ) . (4.4)</p><p>Compare the coefficients for (4.3) and (4.4), we have</p><p>b 0 = 0 ,   b 1 = 0 ,   b 2 = 0 ,   b 3 = 0.</p><p>System (4.2) restricted to the center manifold is given by</p><p>x ˜ ( n + 1 ) = ( − 1 − a * ) x ˜ ( n ) − b x ˜ 2 ( n ) + O ( ( | x ˜ ( n ) | + | a * | ) 3 ) . (4.5)</p><p>Let</p><p>F ( x ˜ ( n ) , a * ) = x ˜ ( n + 1 ) .</p><p>then</p><p>F ( 0 , 0 ) = 0 ,   ∂ F ∂ x ˜ ( n ) | ( 0 , 0 ) = − 1 ,</p><p>α = ( ∂ 2 F ∂ x ˜ ( n ) ∂ a * + 1 2 ∂ F ∂ a * ∂ 2 F ∂ x ˜ 2 ( n ) ) | ( 0 , 0 ) = 1 ≠ 0 ,</p><p>β = [ 1 6 ∂ 3 F ∂ x ˜ 3 ( n ) + ( 1 2 ∂ 2 F ∂ x ˜ 2 ( n ) ) 2 ] | ( 0 , 0 ) = b 2 &gt; 0.</p><p>Based on the above analysis, we have the following results.</p><p>Theorem 4.1 System (1.2) undergoes a flip bifurcation at E 1 ( a − 1 b ,0 ) when parameter a varies in a small neighbourhood of F B E 1 3 .</p></sec><sec id="s5"><title>5. Numerical Simulations</title><p>In this section, we use the bifurcation diagrams, phase portraits diagrams and the Maximum Lyapunov exponents diagrams of the system (1.2) to validate the above analytical result. Then, we consider bifurcation parameters in the following two cases.</p><p>Case I: Suppose that parameters a = 2 , b = 1 , c = 1 , d = 3 , m = 1 in system (1.2). We see that a fold bifurcation occurs at the fixed point ( a − 1 b ,0 ) when f = d + 1 = 4 . This confirms Theorem 3.1.</p><p><xref ref-type="fig" rid="fig1">Figure 1</xref> shows the bifurcation diagram of system (1.2). We can see that the fixed point E 1 ( 1,0 ) is stable on the center manifold for 3.5 &lt; f ≤ 4 . When f &gt; 4 the fixed point E 1 ( 1,0 ) on the center manifold becomes unstable. At the same time, there occurs a new fixed point ( 4 f ,1 − 4 f ) when f &gt; 4 . Hence, the transcritical type of fold bifurcation takes place. The phase diagrams of system (1.2) which are associated with <xref ref-type="fig" rid="fig1">Figure 1</xref> are displayed in Figures 2(a)-(h) with different f.</p><p>Case II: Suppose that parameters f = 2.9 , b = 1 , c = 1 , d = 2 , m = 1 in system (1.2). We see that a flip bifurcation occurs at the fixed point ( a − 1 b ,0 ) when a = 3 . This confirms Theorem 4.1.</p><p><xref ref-type="fig" rid="fig3">Figure 3</xref>(a) shows the bifurcation diagram of system (1.2). We can see that the fixed point E 1 ( a − 1,0 ) is stable for a &lt; 3 . When a = 3 , system (1.2) occurs a subcritical flip bifurcation at the fixed point E 1 ( a − 1,0 ) . When a increases to 3.6, system (1.2) undergoes a cascade of inverse period-doubling bifurcations. Subsequently, the system (1.2) near the fixed point E 1 ( a − 1,0 ) is chaotic with narrow periodic windows. The Maximum Lyapunov exponents corresponding to <xref ref-type="fig" rid="fig3">Figure 3</xref>(a) are calculated in <xref ref-type="fig" rid="fig3">Figure 3</xref>(b), which is consistent with the bifurcation diagram. The phase diagrams of system (1.2) which are associated with <xref ref-type="fig" rid="fig3">Figure 3</xref> are displayed in <xref ref-type="fig" rid="fig4">Figure 4</xref>(a)-(h) with different f.</p></sec><sec id="s6"><title>6. Conclusion</title><p>In this paper, a discrete prey-predator model with ratio-dependent functional response in the closed first quadrant is established. We obtain the equilibrium points of system (1.2) and the conditions for its existence. Moreover, we show that the boundary equilibrium point of system (1.2) can undergo flip bifurcation and Hopf bifurcation by using center manifold theorem and bifurcation theory. The system (1.2) displays interesting dynamical behaviors, including cascade of period-doubling, chaotic with narrow periodic windows and period-2 orbits, which implie that the boundary equilibrium points of system (1.2) lose stability via bifurcation. Nevertheless, the bifurcation of positive equilibrium point has not been discussed. It is a further research topic on how to set reasonable parameters to analyze the bifurcation at the positive equilibrium point.</p></sec><sec id="s7"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s8"><title>Cite this paper</title><p>Duan, M.X. and Ma, J.Y. (2023) Dynamical Behavior of Discrete Ratio-Dependent Predator-Prey System. Open Journal of Applied Sciences, 13, 396-413. https://doi.org/10.4236/ojapps.2023.133032</p></sec></body><back><ref-list><title>References</title><ref id="scirp.123900-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">May, R. (1976) Simple Mathematical Models with Very Complicated Dynamics, Nature, 261, 459-467. https://doi.org/10.1038/261459a0</mixed-citation></ref><ref id="scirp.123900-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Liu, X.L. and Xiao, D.M. (2007) Complex Dynamic Behaviors of a Discrete-Time Predator-Prey System, Chaos, Solitons &amp; Fractals, 32, 80-94. https://doi.org/10.1016/j.chaos.2005.10.081</mixed-citation></ref><ref id="scirp.123900-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Chen, G., Teng, Z. and Hu, Z. (2011) Analysis of Stability for a Discrete Ratio-Dependent Predator-Prey System. Indian Journal of Pure and Applied Mathematics, 42, 1-26. https://doi.org/10.1007/s13226-011-0001-0</mixed-citation></ref><ref id="scirp.123900-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Elettreby, M.F., Nabil, T. and Khawagi, A. (2020) Stability and Bifurcation Analysis of a Discrete Predator-Prey Model with Mixed Holling Interaction. Computer Modeling in Engineering and Sciences, 122, 907-921.https://doi.org/10.32604/cmes.2020.08664</mixed-citation></ref><ref id="scirp.123900-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Elettreby, M.F., Khawagi, A. and Nabil, T. (2019) Dynamics of a Discrete Prey-Predator Model with Mixed Functional Response. International Journal of Bifurcation and Chaos, 29, 1950199. https://doi.org/10.1142/S0218127419501992</mixed-citation></ref><ref id="scirp.123900-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Arditi, R. and Ginzburg, L.R. (1989) Coupling in Predator-Prey Dynamics: Ratio-Dependence. Journal of Theoretical Biology, 139, 311-326.https://doi.org/10.1016/S0022-5193(89)80211-5</mixed-citation></ref><ref id="scirp.123900-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Rosenzweig, M.L. (1971) Paradox of Enrichment: Destabilization of Exploitation Ecosystems in Ecological Time. Science, 171, 385-387.https://doi.org/10.1126/science.171.3969.385</mixed-citation></ref><ref id="scirp.123900-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Xiao, D.M. and Ruan, S.G. (2001) Global Dynamics of a Ratio-Dependent Predator-Prey System. Journal of Mathematical Biology, 43, 268-290.https://doi.org/10.1007/s002850100097</mixed-citation></ref><ref id="scirp.123900-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Xiao, D.M. and Jennings, L.S. (2005) Bifurcations of a Ratio-Dependent Predator-Prey System with Constant Rate Harvesting. SIAM Journal on Applied Mathematics, 65, 737-753. https://doi.org/10.1137/S0036139903428719</mixed-citation></ref><ref id="scirp.123900-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Xiao, D.M., Li, W.X. and Han, M.A. (2006) Dynamics in a Ratio-Dependent Predator-Prey Model with Predator Harvesting. Journal of Mathematical Analysis and Applications, 324, 14-29. https://doi.org/10.1016/j.jmaa.2005.11.048</mixed-citation></ref><ref id="scirp.123900-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Kuang, Y. and Beretta, E. (1998) Global Qualitative Analysis of a Ratio-Dependent Predator-Prey System. Journal of Mathematical Biology, 36, 389-406.https://doi.org/10.1007/s002850050105</mixed-citation></ref><ref id="scirp.123900-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Sohel Rana, S.M. (2017) Chaotic Dynamics and Control of Discrete Ratio-Dependent Predator-Prey System, Discrete Dynamics in Nature and Society, 2017, Article ID: 4537450. https://doi.org/10.1155/2017/4537450</mixed-citation></ref><ref id="scirp.123900-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Kuznetsov, Y.A. (1998) Elements of Applied Bifurcation Theory. Applied Mathematical Sciences, 2nd Edition, Springer-Verlag, New York, 112.</mixed-citation></ref></ref-list></back></article>