Abstract
In this paper we study the quantity \(\mathbb{E} \sup_{{t \in T}}X_{t},\) where X t is some random process. In the case of the Gaussian process, there is a natural sub-metric d defined on T. We find an upper bound in terms of labelled-covering trees of (T,d) and a lower bound in terms of packing trees (this uses the knowledge of packing numbers of subsets of T). The two quantities are proved to be equivalent via a general result concerning packing trees and labelled-covering trees of a metric space. Instead of using the majorizing measure theory, all the results involve the language of entropy numbers. Part of the results can be extended to some more general processes which satisfy some concentration inequality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin/Heidelberg
About this chapter
Cite this chapter
Guédon, O., Zvavitch, A. (2003). Supremum of a Process in Terms of Trees. In: Milman, V.D., Schechtman, G. (eds) Geometric Aspects of Functional Analysis. Lecture Notes in Mathematics, vol 1807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36428-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-36428-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00485-1
Online ISBN: 978-3-540-36428-3
eBook Packages: Springer Book Archive