SearcharxivSearch

arXiv · 1810.12132

Dominating Points of Gaussian Extremes

Abstract

We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic function of a unique "dominating point" located on the boundary of the convex set. Furthermore, the dominating point is identified as the optimizer of a certain convex quadratic programming problem, indicating a "collusion" between the dependence structure of the Gaussian random vectors and the geometry of the convex set in determining the asymptotics. We specialize our main result to polyhedral sets which appear frequently in other contexts involving logarithmic asymptotics. We also extend the main result to characterize the large deviations of Gaussian-mixture extreme value statistics on general convex sets. Our results have implications to contexts arising in rare-event probability estimation and stochastic optimization, since the nature of the dominating point and the rate function suggest importance sampling measures.

Explore related subjects

Keep this discovery

BibTeXRIS

Harsha Honnappa, Raghu Pasupathy, Prateek Jaiswal. 2018-10-29. Dominating Points of Gaussian Extremes. https://arxiv.org/abs/1810.12132

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