Search arXivSearch

arXiv · 2211.09276

Lotka-Volterra predator-prey model with periodically varying carrying capacity

Abstract

We study the stochastic spatial Lotka-Volterra (LV) model for predator-prey interaction subject to a periodically varying carrying capacity. The LV model with on-site lattice occupation restrictions that represent finite food resources for the prey exhibits a continuous active-to-absorbing phase transition. The active phase is sustained by spatio-temporal patterns in the form of pursuit and evasion waves. Monte Carlo simulations on a two-dimensional lattice are utilized to investigate the effect of seasonal variations of the environment on species coexistence. The results of our simulations are also compared to a mean-field analysis. We find that the parameter region of predator and prey coexistence is enlarged relative to the stationary situation when the carrying capacity varies periodically. The stationary regime of our periodically varying LV system shows qualitative agreement between the stochastic model and the mean-field approximation. However, under periodic carrying capacity switching environments, the mean-field rate equations predict period-doubling scenarios that are washed out by internal reaction noise in the stochastic lattice model. Utilizing visual representations of the lattice simulations and dynamical correlation functions, we study how the pursuit and evasion waves are affected by ensuing resonance effects. Correlation function measurements indicate a time delay in the response of the system to sudden changes in the environment. Resonance features are observed in our simulations that cause prolonged persistent spatial correlations. Different effective static environments are explored in the extreme limits of fast- and slow periodic switching. The analysis of the mean-field equations in the fast-switching regime enables a semi-quantitative description of the stationary state.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohamed Swailem, Uwe C. Täuber. 2023-06-12. Lotka-Volterra predator-prey model with periodically varying carrying capacity. https://doi.org/10.1103/physreve.107.064144

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Evolution as fitness landscape navigation: concepts, measures, and emerging questions

Fitness landscapes are mappings between genotypes, phenotypes, and fitness that shape evolution. In recent years, empirical work and theoretical models have greatly advanced our understanding of how populations navigate rugged fitness landscapes. Here, we provide a timely review of the theoretical aspects of this field. Its rapidly growing literature employs a wide range of terms, which are sometimes used ambiguously or inconsistently. We therefore begin by defining the major concepts and the field's vocabulary, highlighting our own terminology choices wherever needed. We then review key results on the relationships between epistasis, ruggedness, accessibility, and navigability for genotype-fitness maps, highlighting several complex and sometimes counterintuitive connections that have emerged. Further, we review how the conserved structural properties of the underlying genotype-phenotype map, which can lead to the formation of large connected neutral networks of genotypes, influence dynamics on fitness landscapes. We then compare the two levels to study landscape navigation: the level of genotype-phenotype maps and the level of genotype-fitness maps. Our review leads us to propose a new measure of navigability, based on evolutionary outcomes, that is broadly applicable and overcomes limitations of existing measures. Finally, we highlight examples from the smaller body of work that relaxes the common assumption of fitness-monotonic paths on static landscapes, and discuss how this can fundamentally change the nature of fitness landscape navigation. Throughout the review, we identify directions for future work to fill existing gaps and to synthesize the disparate strands of research within the field.

q-bio.PE

Best Matches in Phylogenetic Networks

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

q-bio.PE

Exact Counts of Binary Phylogenetic Networks with Four Reticulations

Phylogenetic networks provide a flexible framework for representing reticulate evolutionary processes, such as hybridization, introgression, recombination, and horizontal gene transfer. However, their combinatorial complexity makes even basic enumeration problems difficult. Building on our previous work for networks with up to three reticulations, we derive an explicit closed-form formula for the number of unrestricted rooted binary phylogenetic networks with four reticulations on \(n\) labeled taxa. Our approach is based on tree-component graphs. We classify the 79 possible component graphs corresponding to networks with four reticulations into ten groups. We then enumerate the networks associated with each group by combining known counts of one-component networks, forests, and networks with fewer reticulations. Summing these contributions yields the desired formula. This result extends the exact enumeration of unrestricted binary phylogenetic networks to four reticulations and further demonstrates the effectiveness of component graphs for systematically organizing and counting increasingly complex network classes.

q-bio.PE