Search arXivSearch

arXiv · 2408.11179

Impacts of Tempo and Mode of Environmental Fluctuations on Population Growth: Slow- and Fast-Limit Approximations of Lyapunov Exponents for Periodic and Random Environments

Abstract

We examine to what extent the tempo and mode of environmental fluctuations matter for the growth of structured populations. The models are switching, linear ordinary differential equations $x'(t)=A(σ(ωt))x(t)$ where $x(t)=(x_1(t),\dots,x_d(t))$ corresponds to the population densities in the $d$ individual states, $σ(t)$ is a piece-wise constant function representing the fluctuations in the environmental states $1,\dots,N$, $ω$ is the frequency of the environmental fluctuations, and $A(1),\dots,A(n)$ are Metzler matrices. $σ(t)$ can either be a periodic function or correspond to a continuous-time Markov chain. Under suitable conditions, there is a Lyapunov exponent $Λ(ω)$ such that $\lim_{t\to\infty} \frac{1}{t}\log\sum_i x_i(t)=Λ(ω)$ for all non-negative, non-zero initial conditions $x(0)$ (with probability one in the random case). For both forms of switching, we derive analytical first-order and second-order approximations of $Λ(ω)$ in the limits of slow ($ω\to 0$) and fast ($ω\to\infty$) environmental fluctuations. When the order of switching and the average switching times are equal, we show that the first-order approximations of $Λ(ω)$ are equivalent in the slow-switching limit, but not in the fast-switching limit. We illustrate our results with applications to stage-structured and spatially-structured models. When dispersal rates are symmetric, the first order approximations suggest that population growth rates increase with the frequency of switching -- consistent with earlier work on periodic switching. In the absence of dispersal symmetry, we demonstrate that $Λ(ω)$ can be non-monotonic in $ω$. In conclusion, our results show how population growth rates depend on the tempo ($ω$) and mode (random versus deterministic) of the environmental fluctuations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pierre Monmarché, Sebastian J. Schreiber, Édouard Strickler. 2024-08-20. Impacts of Tempo and Mode of Environmental Fluctuations on Population Growth: Slow- and Fast-Limit Approximations of Lyapunov Exponents for Periodic and Random Environments. https://arxiv.org/abs/2408.11179

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