SearcharxivSearch

arXiv · 2008.02272

Normal approximation via non-linear exchangeable pairs

Abstract

We propose a new functional analytic approach to Stein's method of exchangeable pairs that does not require the pair at hand to satisfy any approximate linear regression property. We make use of this theory in order to derive abstract bounds on the normal and Gamma approximation of certain functionals in the Wasserstein distance. Moreover, we illustrate the relevance of this approach by means of three instances of situations to which it can be applied: Functionals of independent random variables, finite population statistics and functionals on finite groups. In the independent case, and in particular for symmetric $U$-statistics, we demonstrate in which respect this approach yields fundamentally better bounds than those in the existing literature. Finally, we apply our results to provide Wasserstein bounds in a CLT for subgraph counts in geometric random graphs based on $n$ i.i.d. points in Euclidean space as well as to the normal approximation of Pearson's statistic.

Explore related subjects

Keep this discovery

BibTeXRIS

Christian Döbler. 2020-08-05. Normal approximation via non-linear exchangeable pairs. https://arxiv.org/abs/2008.02272

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