SearcharxivSearch

arXiv · 2012.06189

Random cones in high dimensions I: Donoho-Tanner and Cover-Efron cones

Abstract

Two models of random cones in high dimensions are considered, together with their duals. The Donoho-Tanner random cone $D_{n,d}$ can be defined as the positive hull of $n$ independent $d$-dimensional Gaussian random vectors. The Cover-Efron random cone $C_{n,d}$ is essentially defined as the same positive hull, conditioned on the event that it is not the whole space. We consider expectations of various combinatorial and geometric functionals of these random cones and prove that they satisfy limit theorems, as $d$ and $n$ tend to infinity in a suitably coordinated way. This includes, for example, large deviation principles and central as well as non-central limit theorems for the expected number of $k$-faces and the $k$-th conic intrinsic volumes, as $n$, $d$ and possibly also $k$ tend to infinity simultaneously. Furthermore, we determine the precise high-dimensional asymptotic behaviour of the expected statistical dimension for both models of random cones, uncovering thereby another high-dimensional phase transition. As an application, limit theorems for the number of $k$-faces of high-dimensional polytopes generated by random Gale diagrams are discussed as well.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Godland, Zakhar Kabluchko, Christoph Thaele. 2020-12-11. Random cones in high dimensions I: Donoho-Tanner and Cover-Efron cones. https://arxiv.org/abs/2012.06189

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