Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2301.03557

Chaos synchronization: Using prey abundance to synchronize two chaotic GLV models

Shubhangi Dwivedi·Nitu Kumari·Ranjit Kumar Upadhyay
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work investigates the synchronization between two chaotic food webs using the generalized Lotka-Volterra (GLV) model consisting of one prey and two predator populations. We, first, examine the impact of three functional responses (linear, Holling type II, and Holling type III) on system dynamics For the study, we consider the model with a linear functional response consisting of chaotic oscillations and apply controllers to stabilize its unstable fixed points. This research contributes to the understanding of how to apply chaotic ecological models to predict the population of competing species in one habitat using information about similar populations in another system. To do this, we configure a drive-response system where prey acts as the driving variable and both predators depend only on the prey. We use active and adaptive control methods to synchronize two coupled GLV models and verify the analytical results through numerical simulations.

Explore related subjects

math.DSnlin.CD

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shubhangi Dwivedi, Nitu Kumari, Ranjit Kumar Upadhyay. 2023-01-09. Chaos synchronization: Using prey abundance to synchronize two chaotic GLV models. https://arxiv.org/abs/2301.03557

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

KEEP EXPLORING

Related papers

arXiv2026

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS↗
arXiv2026

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS↗
arXiv2026

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS↗