Search arXivSearch

arXiv · 2509.22513

Age-structured stochastic populations under dynamic harvesters' behavior: well-posedness, asymptotic stability and numerically-amenable approximations

Abstract

In this paper we study a model of age-structured ecological populations in continuous interaction with a community of harvesters. We propose an individual-based model for this feedback interactions and prove its convergence to a system of coupled stochastic differential equations. This limit process is complemented with socio-ecological and environmental factors. For the resulting system we establish well-posedness, positivity, and the non-attainability of extinction boundaries, together with its long-term behavior and numerical approximation, relying on ad-hoc arguments to handle the super-linear growth and non-Lipschitz coefficients. Finally, we illustrate some of our findings with numerical experiments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Isidora Ávila-Thieme, Kerlyns Martínez, Héctor Olivero, Mauricio Tejo, Leonardo Videla. 2025-09-26. Age-structured stochastic populations under dynamic harvesters' behavior: well-posedness, asymptotic stability and numerically-amenable approximations. https://arxiv.org/abs/2509.22513

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

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

On the Wasserstein distance between a hyperuniform point process and its mean

We study the existence of bounds on the expected $p$-Wasserstein distance between a random measure and its mean under the assumption that the $p$-th centered moments of the counting statistics are controlled uniformly in space. The average Wasserstein transport cost is shown to be bounded from above and from below by some multiples of the number of points. $D$-dimensional versions of those results are also obtained. As a corollary, we prove that for any value of $p\geq 1$ the Ginibre point process can be seen as a perturbed lattice with identically distributed perturbations with a finite $p$-th moment.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR