On the longest runs in Markov chains

  1. Zhenxia Liu
  2. Xiangfeng Yang


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 method 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.

Download article

This article

Probability and Mathematical Statistics

38, z. 2, 2018

Pages from 407 to 428

Other articles by author

Google Scholar


Your cart (products: 0)

No products in cart

Your cart Checkout