SearcharxivSearch

arXiv · 2604.01257

Enhanced Asymptotic Analysis of Continuous-Time Markov Branching Systems: Revisiting Limiting Structural Theorems

Abstract

Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching structure, allowing transitions to multiple states from a single one. This branching mechanism plays a critical role in modeling phenomena such as population dynamics, epidemic spread, and probabilistic systems with multiple outcomes. Unlike standard Markov processes, branching systems require a simultaneous treatment of transition dynamics and branching probabilities, resulting in a more intricate mathematical framework. In this work, we investigate the asymptotic properties of transition functions in continuous-time Markov branching-immigration systems. Our focus lies in refining known limit theorems, establishing convergence rates, and deriving improved asymptotic expansions under relaxed moment conditions. The results contribute to a deeper understanding of the long-term behavior and invariant structures within these systems.

Explore related subjects

Keep this discovery

BibTeXRIS

Azam A Imomov, Sarvar B. Iskandarov, Jakhongir B. Azimov, Hurshidjon Q. Jumaqulov. 2026-04-01. Enhanced Asymptotic Analysis of Continuous-Time Markov Branching Systems: Revisiting Limiting Structural Theorems. https://doi.org/10.1016/j.chaos.2025.117079

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