Chaining, interpolation and convexity II: the contraction principle

DOI10.1214/17-AOP1214MaRDI QIDQ1647741zbMATH OpenFDO

Authors Ramon van Handel

Publication date 26 June 2018

Published in The Annals of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.05199, https://projecteuclid.org/euclid.aop/1523520028

zbMATH Keywords

random matricesentropy numbersgeneric chainingreal interpolationmajorizing measuressuprema of random processes

Mathematics Subject Classification ID

Gaussian processes (60G15) Probability theory on linear topological spaces (60B11) Geometry and structure of normed linear spaces (46B20) Interpolation between normed linear spaces (46B70) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Abstract: The generic chaining method provides a sharp description of the suprema of many random processes in terms of the geometry of their index sets. The chaining functionals that arise in this theory are however notoriously difficult to control in any given situation. In the first paper in this series, we introduced a particularly simple method for producing the requisite multi scale geometry by means of real interpolation. This method is easy to use, but does not always yield sharp bounds on chaining functionals. In the present paper, we show that a refinement of the interpolation method provides a canonical mechanism for controlling chaining functionals. The key innovation is a simple but powerful contraction principle that makes it possible to efficiently exploit interpolation. We illustrate the utility of this approach by developing new dimension-free bounds on the norms of random matrices and on chaining functionals in Banach lattices. As another application, we give a remarkably short interpolation proof of the majorizing measure theorem that entirely avoids the greedy construction that lies at the heart of earlier proofs.

Recommendations

• Chaining, interpolation, and convexity
• Majorizing measures: The generic chaining
• On generic chaining and the smallest singular value of random matrices with heavy tails
• Chaining and the geometry of stochastic processes
• The Generic Chaining

Cites work

• scientific article; zbMATH DE number 3626044 (Why is no real title available?)
• Applying a theorem of Fernique
• Chaining, interpolation and convexity II: the contraction principle
• Entropy numbers of diagonal operators with an application to eigenvalue problems
• Majorizing measures and proportional subsets of bounded orthonormal systems
• On sparse reconstruction from Fourier and Gaussian measurements
• On the Banach-space-valued Azuma inequality and small-set isoperimetry of Alon-Roichman graphs
• On the spectral norm of Gaussian random matrices
• Random vectors in the isotropic position
• Sharp uniform convexity and smoothness inequalities for trace norms
• Structured random matrices
• Upper and lower bounds for stochastic processes. Modern methods and classical problems
• \(L_{p}\)-moments of random vectors via majorizing measures

Cited in

(11)

• Chaining, interpolation, and convexity
• Tail bounds via generic chaining
• Sudakov minoration for products of radial-type log-concave measures
• scientific article; zbMATH DE number 1978792 (Why is no real title available?)
• On a contraction property of Bernoulli canonical processes
• Chaining, interpolation and convexity II: the contraction principle
• Marcinkiewicz-type discretization of L^p-norms under the Nikolskii-type inequality assumption
• On generic chaining and the smallest singular value of random matrices with heavy tails
• Sampling discretization and related problems
• From Gauss to Kolmogorov: localized measures of complexity for ellipses
• Chaining and the geometry of stochastic processes

This page was built for publication: Chaining, interpolation and convexity II: the contraction principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647741)