Search arXivSearch

arXiv · 2410.04443

Identification des paramètres d'un modèle logistique en dynamique des populations avec sortie affine

Abstract

We study the parameters identification of a dynamic model of a population living in a given host environment governed by a logistic law. We use a statistic Kullback-Leibler type method to derive the algorithm for estimating the parameters of the model in two levels. The first level AIG is an offline algorithm and global it is obtained using the critical points of the reestimation transformation between two parameters. It estimates the parameters in a global iterative manner starting from a block of data. The second level ARE is adaptive recursive and is used online. It constitutes a refinement of the AIG algorithm. The convergence of the AIG algorithm is an open problem. The convergence of the ARE algorithm is demonstrated by constructing a new model, a new space and a new probability law.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Messaoud Souilah, Imene Sabira Soualah. 2024-10-06. Identification des paramètres d'un modèle logistique en dynamique des populations avec sortie affine. https://arxiv.org/abs/2410.04443

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

KEEP EXPLORING

Related papers

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

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

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