期刊文献+

Approximation for Counts of 2-runs in a Two State Markov Chain

Approximation for Counts of 2-runs in a Two State Markov Chain
原文传递
导出
摘要 We consider a Markov chain X = {Xi, i = 1, 2,...} with the state space {0, 1}, and define W = ∑1=1^x XiXi+1, which is the number of 2-runs in X before time n + 1. In this paper, we prove that the negative binomial distribution is an appropriate approximation for LW when VarW is greater than EW. The error estimate obtained herein improves the corresponding result in previous literatures. We consider a Markov chain X = {Xi, i = 1, 2,...} with the state space {0, 1}, and define W = ∑1=1^x XiXi+1, which is the number of 2-runs in X before time n + 1. In this paper, we prove that the negative binomial distribution is an appropriate approximation for LW when VarW is greater than EW. The error estimate obtained herein improves the corresponding result in previous literatures.
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2013年第10期1907-1916,共10页 数学学报(英文版)
基金 Supported by National Natural Science Foundation of China(Grant No.11071021)
关键词 Negative binomial distribution head run Stein's method total variation distance cou-pling Negative binomial distribution, head run, Stein's method, total variation distance, cou-pling
  • 相关文献

参考文献6

  • 1Brown, T. C., Xia, A.: Stein's method and birth-death processes. Ann. Probab., 29, 1373 1403 (2001).
  • 2Schbath, S.: Compound Poisson approximation of word counts in DNA sequences. ESIAM Probab. Statist., 1. 1-16 (1995).
  • 3Stefanov, V. T., Pakes, A. G.: Explicit distributional results in pattern formation. Ann. Appl. Probab., 7, 666-678 (1997).
  • 4Wang, X., Xia, A.: On negative binomial approximation to k-runs. J. Appl. Probab., 45 (2), 456 471 (2008).
  • 5Xia, A., Zhang, M.: On approximation of Markov binomial distributions. Bernoulli, 15(4), 1335-1350 (2009).
  • 6Zhang, M.: Approximation for counts of head runs. Sci. China Math., 54, 311-324 (2010).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部