✦ LIBER ✦

The effect of the Markov chain condition on the prediction of extreme values

✍ Scribed by A. Naess

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 883 KB
Volume: 94
Category: Article
ISSN: 0022-460X
DOI: 10.1016/s0022-460x(84)80007-3

No coin nor oath required. For personal study only.

✦ Synopsis

The purpose of this paper is to study the effect of correlation on extreme value estimates of a narrow-band, stationary Gaussian process. This is done by introducing a Markov chain condition on the sequence of peak values of the process. It is shown that this leads to extreme value estimates that are smaller than those obtained by standard order statistics. Under specified conditions, an explicit formula is obtained for the extreme value estimates resulting from the introduction of the Markov chain condition. Due to the close connection between extreme value statistics and first passage time statistics, a discussion of the impact of the results on the first passage time problem is also given. ~3 So IR(r)I dr<oo, one then defines the (one-sided) spectral dcnsity function as {!So l R(r) coscordr, ~o~0 S(to) = <0J" (3)

📜 SIMILAR VOLUMES

Correction note: “The effect of the Mark

Correction note: “The effect of the Markov chain condition on the prediction of extreme values”

✍ A. Naess 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 93 KB

On the value function in constrained con

On the value function in constrained control of Markov chains

✍ Eitan Altman; Arie Hordijk; Lodewijk C. M. Kallenberg 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 648 KB

On the relationship of the Markov mesh t

On the relationship of the Markov mesh to the NSHP Markov chain

✍ Fure-Ching Jeng; John W Woods 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 333 KB

On the Markov property of a finite hidde

On the Markov property of a finite hidden Markov chain

✍ Peter Spreij 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 119 KB

In this paper we study the question of the conditions under which a hidden Markov chain itself exhibits Markovian behaviour. An insightful method to answer this question is based on a recursive ÿltering formula for the underlying chain.

On the range of recurrent Markov chains

✍ K.B Athreya 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 152 KB

On the conductance of order Markov chain

On the conductance of order Markov chains

✍ Alexander Karzanov; Leonid Khachiyan 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 425 KB

Let Q be a convex solid in R", partitioned mto two volumes u and t' by an area s. We show that s > min(u, o)/diam Q, and use this inequality to obtain the lower bound n -'/' on the conductance of order Markov chains, which describe nearly uniform generators of linear extensions for posets of size n.