Search arXivSearch

arXiv · 1507.08688

Stein's method for functions of multivariate normal random variables

Abstract

By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $Σ^{1/2}\mathbf{Z}$, then the sequence of random variables $(g(\mathbf{W}_n))_{n\geq1}$ converges in distribution to $g(Σ^{1/2}\mathbf{Z})$ if $g:\mathbb{R}^d\rightarrow\mathbb{R}$ is continuous. In this paper, we develop Stein's method for the problem of deriving explicit bounds on the distance between $g(\mathbf{W}_n)$ and $g(Σ^{1/2}\mathbf{Z})$ with respect to smooth probability metrics. We obtain several bounds for the case that the $j$-component of $\mathbf{W}_n$ is given by $W_{n,j}=\frac{1}{\sqrt{n}}\sum_{i=1}^nX_{ij}$, where the $X_{ij}$ are independent. In particular, provided $g$ satisfies certain differentiability and growth rate conditions, we obtain an order $n^{-(p-1)/2}$ bound, for smooth test functions, if the first $p$ moments of the $X_{ij}$ agree with those of the normal distribution. If $p$ is an even integer and $g$ is an even function, this convergence rate can be improved further to order $n^{-p/2}$. These convergence rates are shown to be of optimal order. We apply our general bounds to some examples, which include the distributional approximation of asymptotically chi-square distributed statistics; the approximation of expectations of smooth functions of binomial and Poisson random variables; rates of convergence in the delta method; and a quantitative variance-gamma approximation of the $D_2^*$ statistic for alignment-free sequence comparison in the case of binary sequences.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert E. Gaunt. 2019-06-12. Stein's method for functions of multivariate normal random variables. https://arxiv.org/abs/1507.08688

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR