Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  longest run
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
We continue our investigation on general large deviation principles (LDPs) for longest runs. Previously, a general LDP for the longest success run in a sequence of independent Bernoulli trails was derived in [Z. Liu and X. Yang, A general large deviation principle for longest runs, Statist. Probab. Lett. 110 (2016), 128-132]. In the present note, we establish a general LDP for the longest success run in a two-state (success or failure) Markov chain which recovers the previous result in the aforementioned paper. The main new ingredient is to implement suitable estimates of the distribution function of the longest success run recently established in [Z. Liu and X. Yang, On the longest runs in Markov chains, Probab. Math. Statist. 38 (2018), no. 2, 407-428].
2
Content available remote On the longest runs in Markov chains
EN
In the first n steps of a two-state (success and failure) Markov chain, the longest success run L(n) has been attracting considerable attention due to its various applications. In this paper, we study L(n) in terms of its two closely connected properties: moment generating function and large deviations. This study generalizes several existing results in the literature, and also finds an application in statistical inference. Our metod on the moment generating function is based on a global estimate of the cumulative distribution function of L(n) proposed in this paper, and the proofs of the large deviations include the Gärtner-Ellis theorem and the moment generating function.
first rewind previous Strona / 1 next fast forward last
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ć.