A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
REMARKS ON PICKANDS' THEOREMIn this article we present the Pickands theorem and his double sum method. We follow Piterbarg's proof of this theorem. Since his proof relies on general lemmas, we present a complete proof of Pickands' theorem using the Borell inequality and Slepian lemma. The original Pickands' proof is rather complicated and is mixed with upcrossing probabilities for stationary Gaussian processes. We give a lower bound for Pickands constant. Moreover, we review equivalentdoi:10.19195/0208-4188.8.131.52 fatcat:yke7rpbvd5hf3beancyoyeyezm