Majorizing measures: The generic chaining (Q2565350): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:41, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Majorizing measures: The generic chaining |
scientific article |
Statements
Majorizing measures: The generic chaining (English)
0 references
25 February 1997
0 references
Majorizing measures provide bounds for the supremum of stochastic processes. They arose from the theory of Gaussian processes (the first major success of majorizing measures was to characterize sample boundedness and sample continuity of these processes), but they now have applications far beyond this setting. The fundamental question is the construction of these measures. The present paper focuses on the tools that have been developed for this purpose and, in particular, the use of geometric ideas. It discusses the author's remarkable work since his paper on regularity of Gaussian processes [Acta Math. 159, No. 1/2, 99-149 (1987; Zbl 0712.60044)]. Contents: 1. Introduction; 2. Chaining, generic chaining, majorizing measures; 3. A first look at ellipsoids; 4. The partitioning scheme; 5. Gaussian processes; 6. The ellipsoid theorem and matchings; 7. Restriction of operators; 8. Convex hull and open problems; 9. Families of distances; References.
0 references
majorizing measures
0 references
Gaussian processes
0 references
regularity of Gaussian processes
0 references
open problems
0 references