SearcharxivSearch

arXiv · 2110.11641

Nonsymmetric examples for Gaussian correlation inequalities

Abstract

In this paper, we compare two variances of maxima of $N$ standard Gaussian random variables. One is a sequence of $N$ i.i.d. standard Gaussians, and the other one is $N$ standard Gaussians with covariances $\sigma_{1,2}=\rho \in(0,1)$ and $\sigma_{i,j}=0$, for other $ i\neq j$. It turns out that we need to discuss the covariance of two functions with respect to multivariate Gaussian distributions. Gaussian correlation inequalities hold for many symmetric (with respect to the origin) cases. However, in our case, the max function and its derivatives are not symmetric about the origin. We have two main results in this paper. First, we prove a specific case for a convex/log-concave correlation inequality for the standard multivariate Gaussian distribution. The other result is that the variance of maxima of standard Gaussians with $\sigma_{1,2}=\rho \in(0,1)$, while $\sigma_{i,j}=0$, for other $ i\neq j$, is larger than the variance of maxima of independent standard Gaussians. This implies that the variance of maxima of $N$ i.i.d. standard Gaussians is decreasing in $N$.

Explore related subjects

Keep this discovery

BibTeXRIS

Chien-Hao Huang. 2021-10-22. Nonsymmetric examples for Gaussian correlation inequalities. https://arxiv.org/abs/2110.11641

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