SearcharxivSearch

arXiv · 2208.03398

Geometric Approach For Majorizing Measures

Abstract

Gaussian processes can be considered as subsets of a standard Hilbert space, but the geometric understanding that would relate the size of a set with the size of its convex hull is still lacking. In this work, we adopt a geometric approach to the majorizing measure problem by identifying the covering number relationships between a given space $T$ and its convex hull, represented by $T_h$. If the space $T$ is a closed bounded polyhedra in $\mathbb{R}^n$, we can evaluate the volume ratio between the space $T$ and its convex hull obtained by the Quickhull algorithm. If the space $T$ is a general compact object in $\mathbb{R}^n$ with non-empty interior, we first establish a more general reverse Brunn-Minkowski inequality for nonconvex spaces which will assist us to bound the volume of $T_h$ in terms of the volume of $T$ if $T_h$ can be acquired by the finite average of the space $T$ with respect to the Minkowski sum. If the volume ratio between the space $T$ and the space $T_h$ is obtained, the covering number ratio between the space $T$ and the space $T_h$ can also be obtained which will be used to build majorizing measure inequality. For infinite dimensional space, we show that the constant $L$ at majorizing measure inequality may not always exist and the existence condition will depend on geometric properties of $T$.

Explore related subjects

Keep this discovery

BibTeXRIS

Shih-Yu Chang. 2022-08-05. Geometric Approach For Majorizing Measures. https://arxiv.org/abs/2208.03398

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