SearcharxivSearch

arXiv · 2302.09946

Multidimensional Stein method and quantitative asymptotic independence

Abstract

If $\mathbb{Y}$ is a random vector in $\mathbb{R}^{d}$, we denote by $P_{\mathbb{Y}}$ its probability distribution. Consider a random variable $X$ and a $d$-dimensional random vector $\mathbb{Y}$. Inspired by \cite{Pi}, we develop a multidimensional Stein-Malliavin calculus which allows to measure the Wasserstein distance between the law $P_{ (X, \mathbb{Y})}$ and the probability distribution $P_{Z}\otimes P_{\mathbb{Y}}$, where $Z$ is a Gaussian random variable. That is, we give estimates, in terms of the Malliavin operators, for the distance between the law of the random vector $(X, \mathbb{Y})$ and the law of the vector $(Z, \mathbb{Y})$, where $Z$ is Gaussian and independent of $\mathbb{Y}$. Then we focus on the particular case of random vectors in Wiener chaos and we give an asymptotic version of this result. In this situation, this variant of the Stein-Malliavin calculus has strong and unexpected consequences. Let $(X_{k}, k\geq 1)$ be a sequence of random variables in the $p$th Wiener chaos ($p\geq 2$), which converges in law, as $k\to \infty$, to the Gaussian distribution $N(0, \sigma^2)$. Also consider $(\mathbb{Y}_{k}, k\geq 1)$ a $d$-dimensional random sequence converging in $L^{2}(\Omega)$, as $k\to \infty$, to an arbitrary random vector $\mathbb{U}$ in $\mathbb{R}^{d}$ and assume that the two sequences are asymptotically uncorrelated. We prove that, under very light assumptions on $\mathbb{Y}_{k}$, we have the joint convergence of $(X_{k}, \mathbb{Y}_{k}), k\geq 1)$ to $(Z, \mathbb{U})$ where $Z\sim N(0, \sigma ^{2})$ is indeendent of $\mathbb{U}$. These assumptions are automatically satisfied when the components of the vector $\mathbb{Y}_{k}$ belong to a finite sum of Wiener chaoses or when $\mathbb{Y}_{k}=Y$ for every $k\geq 1$, where $\mathbb{Y}$ belongs to the Sobolev-Malliavin space $\mathbb{D}^{1,2}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ciprian A Tudor. 2023-02-20. Multidimensional Stein method and quantitative asymptotic independence. https://arxiv.org/abs/2302.09946

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