SearcharxivSearch

arXiv · 2105.05127

Stochastic Functional Kolmogorov Equations II: Extinction

Abstract

This work, Part II, together with its companion Part I develops a new framework for stochastic functional Kolmogorov equations, which are nonlinear stochastic differential equations depending on the current as well as the past states. Because of the complexity of the problems, it is natural to divide our contributions into two parts to answer a long-standing question in biology and ecology. What are the minimal conditions for long-term persistence and extinction of a population? Part I of our work provides characterization of persistence, whereas in this part, extinction is the main focus. The main techniques used in this paper are combination of the newly developed functional It^o formula and a dynamical system approach. Compared to the study of stochastic Kolmogorov systems without delays, the main difficulty is that infinite dimensional systems have to be treated. The extinction is characterized after investigating random occupation measures and examining behavior of functional systems around boundaries. Our characterizations of long-term behavior of the systems reduces to that of Kolmogorov systems without delay when there is no past dependence. A number of applications are also examined.

Explore related subjects

Keep this discovery

BibTeXRIS

Dang H. Nguyen, Nhu N. Nguyen, George Yin. 2021-05-11. Stochastic Functional Kolmogorov Equations II: Extinction. https://arxiv.org/abs/2105.05127

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR