IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v45y2016i3p597-611.html
   My bibliography  Save this article

Online change detection of Markov chains with unknown post-change transition probabilities

Author

Listed:
  • Jin-Guo Xian
  • Dong Han
  • Jian-Qi Yu

Abstract

In this paper, we investigate the performance of cumulative sum (CUSUM) stopping rules for the online detection of unknown change point in a time homogeneous Markov chain. Under the condition that the post-change transition probabilities are unknown, we proposed two CUSUM type schemes for the detection. The first scheme is based on the maximum likelihood estimates of the post-change transition probabilities. This scheme is limited by its computation burden, which is mitigated by another scheme based on the reference transition probabilities selected from a prior known region. We give the bounds of the mean delay time and the mean time between false alarms to illustrate the effectiveness of the proposed schemes. The results of the simulation also demonstrate the feasibility of the proposed schemes.

Suggested Citation

  • Jin-Guo Xian & Dong Han & Jian-Qi Yu, 2016. "Online change detection of Markov chains with unknown post-change transition probabilities," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(3), pages 597-611, February.
  • Handle: RePEc:taf:lstaxx:v:45:y:2016:i:3:p:597-611
    DOI: 10.1080/03610926.2013.833243
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2013.833243
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2013.833243?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guglielmo D'Amico & Filippo Petroni & Philippe Regnault & Stefania Scocchera & Loriano Storchi, 2019. "A copula based Markov Reward approach to the credit spread in European Union," Papers 1902.00691, arXiv.org.
    2. Damásio, Bruno & Nicolau, João, 2024. "Time inhomogeneous multivariate Markov chains: Detecting and testing multiple structural breaks occurring at unknown dates," Chaos, Solitons & Fractals, Elsevier, vol. 180(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:45:y:2016:i:3:p:597-611. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.