SearcharxivSearch

arXiv · 1911.04184

Grassmann angles and absorption probabilities of Gaussian convex hulls

Abstract

Let $M$ be an arbitrary subset in $\mathbb R^n$ with a conic (or positive) hull $C$. Consider its Gaussian image $AM$, where $A$ is a $k\times n$-matrix whose entries are independent standard Gaussian random variables. We show that the probability that the convex hull of $AM$ contains the origin in its interior coincides with the $k$-th Grassmann angle of $C$. Also, we prove that the expected Grassmann angles of $AC$ coincide with the corresponding Grassmann angles of $C$. Using the latter result, we show that the expected sum of $j$-th Grassmann angles at $\ell$-dimensional faces of a Gaussian simplex equals the analogous angle-sum for the regular simplex of the same dimension.

Explore related subjects

Keep this discovery

BibTeXRIS

Friedrich Götze, Zakhar Kabluchko, Dmitry Zaporozhets. 2019-11-11. Grassmann angles and absorption probabilities of Gaussian convex hulls. https://arxiv.org/abs/1911.04184

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