Renewed Limit Theorems for the discrete-time Branching Process and its Conditioned Limiting Law interpretation

Azam A. Imomov

Home/Archive/arXiv

arXiv · 2004.09307

Renewed Limit Theorems for the discrete-time Branching Process and its Conditioned Limiting Law interpretation

Azam A. Imomov

View original source ↗Read source document ↗Export metadata ↓

Abstract

Our principal aim is to observe the Markov discrete-time process of population growth with long-living trajectory. First we study asymptotical decay of generating function of Galton-Watson process for all cases as the Basic Lemma. Afterwards we get a Differential analogue of the Basic Lemma. This Lemma plays main role in our discussions throughout the paper. Hereupon we improve and supplement classical results concerning Galton-Watson process. Further we investigate properties of the population process so called Q-process. In particular we obtain a joint limit law of Q-process and its total state. And also we prove the analogue of Law of large numbers and the Central limit theorem for total state of Q-process. Keywords: Branching process; transition function; Q-process; invariant measures; ergodic chain; total states; joint distribution; limit theorem.

Explore related subjects

math.PR

Keep this discovery

BibTeX RIS

Azam A. Imomov. 2020-04-17. Renewed Limit Theorems for the discrete-time Branching Process and its Conditioned Limiting Law interpretation. https://arxiv.org/abs/2004.09307

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗