SearcharxivSearch

arXiv · 2006.10401

Moderate parts in regenerative compositions: the case of regular variation

Abstract

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the L\'{e}vy measure of $S$ is infinite and regularly varying at zero of index $-\alpha$, $\alpha\in(0,\,1)$, we find an explicit threshold $r=r(n)$, such that the number $K_{n,\,r(n)}$ of blocks of size $r(n)$ converges in distribution without any normalization to a mixed Poisson distribution. The sequence $(r(n))$ turns out to be regularly varying with index $\alpha/(\alpha+1)$ and the mixing distribution is that of the exponential functional of $S$. The result is derived as a consequence of a general Poisson limit theorem for an infinite occupancy scheme with power-like decay of the frequencies. We also discuss asymptotic behavior of $K_{n,\,w(n)}$ in cases when $w(n)$ diverges but grows slower than $r(n)$. Our findings complement previously known strong laws of large numbers for $K_{n,\,r}$ in case of a fixed $r\in\mathbb{N}$. As a key tool we employ new Abelian theorems for Laplace--Stiletjes transforms of regularly varying functions with the indexes of regular variation diverging to infinity.

Explore related subjects

Keep this discovery

BibTeXRIS

Dariusz Buraczewski, Bohdan Dovgay, Alexander Marynych. 2020-06-18. Moderate parts in regenerative compositions: the case of regular variation. https://arxiv.org/abs/2006.10401

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