Search arXivSearch

arXiv · 2011.07523

Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures

Abstract

In this paper, we study the asymptotic thin-shell width concentration for random vectors uniformly distributed in Orlicz balls. We provide both asymptotic upper and lower bounds on the probability of such a random vector $X_n$ being in a thin shell of radius $\sqrt{n}$ times the asymptotic value of $n^{-1/2}\left(\mathbb E\left[\| X_n\|_2^2\right]\right)^{1/2}$ (as $n\to\infty$), showing that in certain ranges our estimates are optimal. In particular, our estimates significantly improve upon the currently best known general Lee-Vempala bound when the deviation parameter $t=t_n$ goes down to zero as the dimension $n$ of the ambient space increases. We shall also determine in this work the precise asymptotic value of the isotropic constant for Orlicz balls. Our approach is based on moderate deviation principles and a connection between the uniform distribution on Orlicz balls and Gibbs measures at certain critical inverse temperatures with potentials given by Orlicz functions, an idea recently presented by Kabluchko and Prochno in [The maximum entropy principle and volumetric properties of Orlicz balls, J. Math. Anal. Appl. {\bf 495}(1) 2021, 1--19].

Explore related subjects

Keep this discovery

BibTeXRIS

David Alonso-Gutiérrez, Joscha Prochno. 2020-11-15. Thin-shell concentration for random vectors in Orlicz balls via moderate deviations and Gibbs measures. https://arxiv.org/abs/2011.07523

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