SearcharxivSearch

arXiv · 2510.20000

Classification for dynamics of Markov chains on non-negative integers with arbitrary transition rates and its application

Abstract

Continuous-time Markov chains on non-negative integers can be used for modeling biological systems, population dynamics, and queueing models. Qualitative behaviors of birth-and-death models, typical examples of such one-dimensional continuous-time Markov chains, have been substantially studied. For one-dimensional Markov chains with polynomial transition rates, recent studies provided criteria for their long-term behavior. In this paper, we provide a classification of Markov chains on non-negative integers when the transition rates are arbitrary functions. The criteria are written with asymptotics of the transition rates. This classification implies their dynamical properties, including explosivity, recurrence, positive recurrence, and exponential ergodicity. As an application, we derive a complete classification (if and only if conditions) for those dynamical features when the transition rates have certain expansion forms, which include all rational functions, so that our classifications cover mass-action kinetics, Michaelis-Menten kinetics, and Haldane equations. Our classification solely relies on easily computable quantities: the maximal degree of the expansion of the transition rates, the mean and the variance of the transition rates. We demonstrate the utility of this classification framework using the approximation of high-dimensional mass-action systems by a one-dimensional reaction system with general rational kinetics.

Explore related subjects

Keep this discovery

BibTeXRIS

Minjun Kim, Seokhwan Moon, Jinsu Kim. 2025-10-22. Classification for dynamics of Markov chains on non-negative integers with arbitrary transition rates and its application. https://arxiv.org/abs/2510.20000

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