On the autopersistence functions and the autopersistence graphs of binary autoregressive time series

Chao WANG, Wai Keung LI

Research output: Contribution to journalArticlespeer-review

11 Citations (Scopus)

Abstract

The classical autocorrelation function may not be an effective and informative means in revealing the dependence features of a binary time series {yt}. Recently, the autopersistence functions defined as APF0(k) = P(yt+k = 1 | y= 0) and APF1(k) = P(yt+k = 1 | y= 1), k = 1, 2,…, have been proposed as alternatives to the autocorrelation function for binary time series. In this article we consider the theoretical autopersistence functions and their natural sample analogues, the autopersistence graphs, under a binary autoregressive model framework. Some properties of the autopersistence functions and the asymptotic properties of the autopersistence graphs are discussed. The results have potential application in the modelling of binary time series. Copyright © 2011 Blackwell Publishing Ltd.
Original languageEnglish
Pages (from-to)639-646
JournalJournal of Time Series Analysis
Volume32
Issue number6
Early online dateMar 2011
DOIs
Publication statusPublished - Nov 2011

Citation

Wang, C., & Li, W. K. (2011). On the autopersistence functions and the autopersistence graphs of binary autoregressive time series. Journal of Time Series Analysis, 32(6), 639-646. doi: 10.1111/j.1467-9892.2011.00721.x

Keywords

  • Autopersistence function
  • Autopersistence graph
  • Binary time series
  • Markov chain
  • Consistency
  • Asymptotic normality

Fingerprint

Dive into the research topics of 'On the autopersistence functions and the autopersistence graphs of binary autoregressive time series'. Together they form a unique fingerprint.