Supremum of a process in terms of trees (Q4424447)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1975226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Supremum of a process in terms of trees |
scientific article; zbMATH DE number 1975226 |
Statements
2003
0 references
supremum
0 references
Gaussian processes
0 references
set-valued trees
0 references
0.7418457269668579
0 references
0.7392722964286804
0 references
0.7392040491104126
0 references
0.7282911539077759
0 references
0.7280970811843872
0 references
Supremum of a process in terms of trees (English)
0 references
Let \((T, d)\) be a compact metric space. For any real-valued stochastic process \(X_t\), define \[ E \sup_{t\in T}\, X_t= \sup\Biggl\{ E\sup_{t\in T_f}\, X_t,\;T_f\text{ finite subset of }T\Biggr\}. \] If \(X_t\) satisfies some concentration inequality (in particular if \(X_t\) is Gaussian), the authors find an upper and a lower bound of \(E\sup_{t\in T}\,X_t\) in terms of set-valued trees in \((T, d)\). More precisely they introduce the notions of labelled-covering and packing trees in \((T, d)\), of a size for each of them, express the upper and lower bounds in terms of these sizes, and prove furthermore that these two quantities are equivalent. For the entire collection see [Zbl 1009.00019].
0 references