Approximation of Supremum of Max-Stable Stationary Processes and Pickands Constants

12/12/2017
by   Krzysztof Debicki, et al.
0

Let X(t),t∈R be a stochastically continuous stationary max-stable process with Fréchet marginals Φ_α, α>0 and set M_X(T)=_t ∈ [0,T] X(t),T>0. In the light of the seminal articles [1,2], it follows that A_T=M_X(T)/T^1/α converges in distribution as T→∞ to H_Z^1/α X(1), where H_Z is the Pickands constant corresponding to the spectral process Z of X. In this contribution we derive explicit formulas for H_Z in terms of Z and show necessary and sufficient conditions for its positivity. From our analysis it follows that A_T^β,T>0 is uniformly integrable for any β∈ (0,α). Further, we discuss the dissipative Rosiński (or mixed moving maxima) representation of X. Additionally, for Brown-Resnick X we show the validity of the celebrated Slepian inequality and obtain lower bounds on the growth of supremum of Gaussian processes with stationary increments by exploiting the link between Pickands constants and Wills functional. Moreover, we derive upper bounds for supremum of centered Gaussian processes given in terms of Wills functional, and discuss the relation between Pickands and Piterbarg constants.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/09/2021

Berry-Esseen bounds of second moment estimators for Gaussian processes observed at high frequency

Let Z:={Z_t,t≥0} be a stationary Gaussian process. We study two estimato...
research
02/12/2021

Multivariate Max-Stable Processes and Homogeneous Functionals

Multivariate max-stable processes are important for both theoretical inv...
research
12/21/2017

On the Information Dimension of Multivariate Gaussian Processes

The authors have recently defined the Rényi information dimension rate d...
research
04/14/2021

Discrete sticky couplings of functional autoregressive processes

In this paper, we provide bounds in Wasserstein and total variation dist...
research
02/16/2016

Stochastic Process Bandits: Upper Confidence Bounds Algorithms via Generic Chaining

The paper considers the problem of global optimization in the setup of s...
research
06/01/2012

Predictive Information Rate in Discrete-time Gaussian Processes

We derive expressions for the predicitive information rate (PIR) for the...
research
10/14/2022

Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees

As Gaussian processes mature, they are increasingly being deployed as pa...

Please sign up or login with your details

Forgot password? Click here to reset