SearcharxivSearch

arXiv · 2504.19404

Beyond Poisson Approximation: Sums of Markovian Bernoulli Variables with Applications to Brownian Motions and Branching Processes

Abstract

Let $\{\eta_i\}_{i\ge 1}$ be a sequence of dependent Bernoulli random variables. While the Poisson approximation for the distribution of $\sum_{i=1}^n\eta_i$ has been extensively studied in the literature, this paper establishes new convergence regimes characterized by non-Poisson limits. Specifically, under a Markovian dependence structure, we show that $\sum_{i=1}^n\eta_i,$ under suitable scaling, converges almost surely or in distribution as $n\to\infty$ to a geometric or Gamma random variable. These results provide a new tool for analyzing the limit distributions of sums of Markovian dependent Bernoulli random variables. We demonstrate these results in several applications: determining the limiting distribution of the number of weak cutspheres for a $d(\ge3)$-dimensional standard Brownian motion; deriving the limit law for weak cutpoints of geometric Brownian motion; and analyzing how often the population size reaches a given threshold in certain branching processes, both with and without immigration.

Explore related subjects

Keep this discovery

BibTeXRIS

Hua-Ming Wang, Shuxiong Zhang. 2025-04-28. Beyond Poisson Approximation: Sums of Markovian Bernoulli Variables with Applications to Brownian Motions and Branching Processes. https://arxiv.org/abs/2504.19404

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