IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v484y2025ics0096300324004788.html
   My bibliography  Save this article

Pattern dynamics of a Lotka-Volterra model with taxis mechanism

Author

Listed:
  • Chen, Mengxin

Abstract

This paper deals with the Turing bifurcation and pattern dynamics of a Lotka-Volterra model with the predator-taxis and the homogeneous no-flux boundary conditions. To investigate the pattern dynamics, we first give the occurrence conditions of the Turing bifurcation. It is found that there is no Turing bifurcation when predator-taxis disappears, while the Turing bifurcation occurs as predator-taxis is presented. Next, we establish the amplitude equation by virtue of weakly nonlinear analysis. Our theoretical result suggests the Lotka-Volterra model admits the supercritical or subcritical Turing bifurcation. In this manner, we can determine the stability of the bifurcating solution. Finally, some numerical simulation results verify the validity of the theoretical analysis. The stripe pattern, the mixed patterns, and wave patterns are performed. Interestingly, the stable stripe patterns will be broken and become wave patterns when the predator-taxis parameter is far from the Turing bifurcation critical point.

Suggested Citation

  • Chen, Mengxin, 2025. "Pattern dynamics of a Lotka-Volterra model with taxis mechanism," Applied Mathematics and Computation, Elsevier, vol. 484(C).
    • Handle: RePEc:eee:apmaco:v:484:y:2025:i:c:s0096300324004788
    DOI: 10.1016/j.amc.2024.129017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324004788
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.129017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:484:y:2025:i:c:s0096300324004788. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.