Abstract
We study the asymptotic behavior of the competitive Leslie/Gower model (map) [Formula: see text]It is shown that T unconditionally admits a globally attracting 1-codimensional invariant hypersurface [Formula: see text], called carrying simplex, such that every nontrivial orbit is asymptotic to one in [Formula: see text]. More general and easily checked conditions to guarantee the existence of carrying simplex for competitive maps are provided. An equivalence relation is defined relative to local stability of fixed points on [Formula: see text] (the boundary of [Formula: see text]) on the space of all three-dimensional Leslie/Gower models. Using a formula on the sum of the indices of all fixed points on the carrying simplex for three-dimensional maps, we list the 33 stable equivalence classes in terms of simple inequalities on the parameters [Formula: see text] and [Formula: see text] and draw their orbits on [Formula: see text]. In classes 1-18, every nontrivial orbit tends to a fixed point on [Formula: see text]. In classes 19-25, each map possesses a unique positive fixed point which is a saddle on [Formula: see text], and hence Neimark-Sacker bifurcations do not occur. Neimark-Sacker bifurcation does occur within each of classes 26-31, while it does not occur in class 32. Each map from class 27 admits a heteroclinic cycle, which forms the boundary of [Formula: see text]. The criteria on the stability of heteroclinic cycles are also given. This classification makes it possible to further investigate various dynamical properties in respective class.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.