SearcharxivSearch

arXiv · 2506.10724

Detecting transitions from steady states to chaos with gamma distribution

Abstract

In this paper, we introduce a novel method to identify transitions from steady states to chaos in stochastic models, specifically focusing on the logistic and Ricker equations by leveraging the gamma distribution to describe the underlying population. We begin by showing that when the variance is sufficiently small, the stochastic equations converge to their deterministic counterparts. Our analysis reveals that the stochastic equations exhibit two distinct branches of the intrinsic growth rate, corresponding to alternative stable states characterized by higher and lower growth rates. Notably, while the logistic model does not show a transition from a steady state to chaos, the Ricker model undergoes such a transition when the shape parameter of the gamma distribution is small. These findings not only enhance our understanding of the dynamic behavior in biological populations but also provide a robust framework for detecting chaos in complex systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haiyan Wang, Ying Wang. 2025-06-12. Detecting transitions from steady states to chaos with gamma distribution. https://arxiv.org/abs/2506.10724

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