SearcharxivSearch

arXiv · 1605.06819

A new approach to the Stein-Tikhomirov method: with applications to the second Wiener chaos and Dickman convergence

Abstract

In this paper, we propose a general means of estimating the rate at which convergences in law occur. Our approach, which is an extension of the classical Stein-Tikhomirov method, rests on a new pair of linear operators acting on characteristic functions. In principle, this method is admissible for any approximating sequence and any target, although obviously the conjunction of several favorable factors is necessary in order for the resulting bounds to be of interest. As we briefly discuss, our approach is particularly promising whenever some version of Stein's method applies. We apply our approach to two examples. The first application concerns convergence in law towards targets $F_\infty$ which belong to the second Wiener chaos (i.e. $F_{\infty}$ is a linear combination of independent centered chi-squared rvs). We detail an application to $U$-statistics. The second application concerns convergence towards targets belonging to the generalized Dickman family of distributions. We detail an application to a theorem from number theory. In both cases our method produces bounds of the correct order (up to a logarithmic loss) in terms of quantities which occur naturally in Stein's method.

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Arras, Guillaume Mijoule, Guillaume Poly, Yvik Swan. 2016-05-22. A new approach to the Stein-Tikhomirov method: with applications to the second Wiener chaos and Dickman convergence. https://arxiv.org/abs/1605.06819

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