Search

This study aims to present a complete Hopf bifurcation analysis of a model describing the relationship between prey and predator. A ratio-dependent reaction–diffusion system with two discrete time delays operating under Neumann boundary conditions governs the model that represents this competition. The bifurcation parameter for the analysis is a delay parameter that reflects the amount of time needed for the predator to be able to hunt. Bilazeroğlu and Merdan's algorithm (Bilazeroğlu et al., 2021), which is developed by using the center manifold theorem and normal form theory, is used to establish the existence of Hopf bifurcations and also the stability of the bifurcating periodic solutions. The same procedure is used to illustrate some specific bifurcation properties, such as direction, stability, and period. Furthermore, by examining a model with constant coefficients, we also analyze how diffusion and the amount of time needed for prey to mature impact the model's dynamics. To support the obtained analytical results, we also run some numerical simulations. The results indicate that the dynamic of the mathematical model is significantly influenced by diffusion, the amount of time needed for the predator to gain the capacity to hunt, and the amount of time required for prey to reach maturity that the predator can hunt. [ABSTRACT FROM AUTHOR]

• The first contribution of this research is Hopf bifurcation analysis of a class of system of reaction-diffusion equations involving two discrete time delays under Newmann boundary conditions. The research presents the condition on parameters at which a periodic solution arises locally which is important for the control of a system governed by this class of equations. • The second contribution is determining some properties of existing periodic solutions, including its stability and period. These properties are important to understand the behavior of solutions of a system belonging to this class of equations. • The third contribution is the derivation of an algorithm that will be used for the existence and direction analysis of Hopf bifurcation of a system of equations which lie in that class by simply utilizing the cooefficients in the characteristic equation of its linearized form. This algorithm reduces the complex and time consuming computations to several steps through a systematic schema. We analyze Hopf bifurcation and its properties of a class of system of reaction-diffusion equations involving two discrete time delays. First, we discuss the existence of periodic solutions of this class under Neumann boundary conditions, and determine the required conditions on parameters of the system at which Hopf bifurcation arises near equilibrium point. Bifurcation analysis is carried out by choosing one of the delay parameter as a bifurcation parameter and fixing the other in its stability interval. Second, some properties of periodic solutions such as direction of Hopf bifurcation and stability of bifurcating periodic solution are studied through the normal form theory and the center manifold reduction for functional partial differential equations. Moreover, an algorithm is developed in order to determine the existence of Hopf bifurcation (and its properties) of variety of system of reaction-diffusion equations that lie in the same class. The benefit of this algorithm is that it puts a very complex and long computations of existence of Hopf bifurcation for each equation in that class into a systematic schema. In other words, this algorithm consists of the conditions and formulae that are useful for completing the existence analysis of Hopf bifurcation by only using coefficients in the characteristic equation of the linearized system. Similarly, it is also useful for determining the direction analysis of the Hopf bifurcation merely by using the coefficients of the second degree Taylor polynomials of functions in the right hand side of the system. Finally, the existence of Hopf bifurcation for three different problems whose governing equations stay in that class is given by utilizing the algorithm derived, and thus the feasibility of the algorithm is presented. [ABSTRACT FROM AUTHOR]