For a centered self-similar Gaussian process {Y (t) : t ∈ [0;∞)} and R≥0 we analyze the asymptotic behavior of [formula], for suitably chosen γ> 0. Additionally, we find bounds for HRY , R > 0, and a surprising relation between HY and the classical Pickands constants.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In 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 equivalent definitions, simulations and bounds of Pickands constant.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
In this contribution we discuss the relation between Pickands-type constants defined for certain Brown-Resnick stationary proces W(t), t ϵ R, as [wzór] (set 0Z = R if δ = 0) and the extremal index of the associated max-stable stationary process ξW. We derive several new formulas and obtain lower bounds for ΉδW if W is a Gaussian or a Lévy process. As a by-product we show an interesting relation between Pickands constants and lower tail probabilities for fractional Brownian motions.
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper studies the supremum of chi-square processes with trend over a threshold-dependent-time horizon. Under the assumptions that the chi-square process is generated from a centered self-similar Gaussian process and the trend function is modeled by a polynomial function, we obtain the exact tail asymptotics of the supremum of the chi-square proces with trend. These results are of interest in applications in engineering, insurance, queueing and statistics, etc. Some possible extensions of our results are also discussed.
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Pickands constants appear in the asymptotic formulas for extremes of Gaussian processes. The explicit formula of Pickands constants does not exist. Moreover, in the literature there is no numerical approximation. In this paper we compute numerically Pickands constants by the use of change of measure technique. To this end we apply two different algorithms to simulate fractional Brownian motion. Finally, we compare the approximations with a theoretical hypothesis and a recently obtained lower bound on the constants. The results justify the hypothesis.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.