SearcharxivSearch

arXiv · 1712.10051

On Stein's Method for Infinitely Divisible Laws With Finite First Moment

Abstract

We present, in a unified way, a Stein methodology for infinitely divisible laws (without Gaussian component) having finite first moment. Based on a correlation representation, we obtain a characterizing non-local Stein operator which boils down to classical Stein operators in specific examples. Thanks to this characterizing operator, we introduce various extensions of size bias and zero bias distributions and prove that these notions are closely linked to infinite divisibility. Combined with standard Fourier techniques, these extensions also allow obtaining explicit rates of convergence for compound Poisson approximation in particular towards the symmetric $\alpha$-stable distribution. Finally, in the setting of non-degenerate self-decomposable laws, by semigroup techniques, we solve the Stein equation induced by the characterizing non-local Stein operator and obtain quantitative bounds in weak limit theorems for sums of independent random variables going back to the work of Khintchine and L\'evy.

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Arras, Christian Houdré. 2017-12-28. On Stein's Method for Infinitely Divisible Laws With Finite First Moment. https://doi.org/10.1007/978-3-030-15017-4

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