2000 character limit reached
Suprema of canonical Weibull processes
Published 21 Mar 2015 in math.PR | (1503.06252v2)
Abstract: In this note we investigate the problem of bounding the suprema of canonical processes based on r.v.s with tails $\exp{(-tr)}$, where $0<r \le 1$. We propose a method using non-increasing rearrangement that provides a two-sided bound.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.