Approximation of Sojourn Times of Gaussian Processes
classification
🧮 math.PR
keywords
caseconstantdiscrete-timegaussianpickandsprocessessojournapproximation
read the original abstract
We investigate the tail asymptotic behavior of the sojourn time for a large class of centered Gaussian processes $X$, in both continuous- and discrete-time framework. All results obtained here are new for the discrete-time case. In the continuous-time case, we complement the investigations of [1,2] for non-stationary $X$. A by-product of our investigation is a new representation of Pickands constant which is important for Monte-Carlo simulations and yields a sharp lower bound for Pickands constant.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.