IDEAS home Printed from https://ideas.repec.org/a/spr/aistmt/v72y2020i4d10.1007_s10463-019-00714-6.html
   My bibliography  Save this article

Distributions of pattern statistics in sparse Markov models

Author

Listed:
  • Donald E. K. Martin

    (North Carolina State University)

Abstract

Markov models provide a good approximation to probabilities associated with many categorical time series, and thus they are applied extensively. However, a major drawback associated with them is that the number of model parameters grows exponentially in the order of the model, and thus only very low-order models are considered in applications. Another drawback is lack of flexibility, in that Markov models give relatively few choices for the number of model parameters. Sparse Markov models are Markov models with conditioning histories that are grouped into classes such that the conditional probability distribution for members of each class is constant. The model gives a better handling of the trade-off between bias associated with having too few model parameters and variance from having too many. In this paper, methodology for efficient computation of pattern distributions through Markov chains with minimal state spaces is extended to the sparse Markov framework.

Suggested Citation

  • Donald E. K. Martin, 2020. "Distributions of pattern statistics in sparse Markov models," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 72(4), pages 895-913, August.
    • Handle: RePEc:spr:aistmt:v:72:y:2020:i:4:d:10.1007_s10463-019-00714-6
    DOI: 10.1007/s10463-019-00714-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10463-019-00714-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10463-019-00714-6?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.

    References listed on IDEAS

    as
    1. Väinö Jääskinen & Jie Xiong & Jukka Corander & Timo Koski, 2014. "Sparse Markov Chains for Sequence Data," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 41(3), pages 639-655, September.
    2. Gabadinho, Alexis & Ritschard, Gilbert, 2016. "Analyzing State Sequences with Probabilistic Suffix Trees: The PST R Package," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 72(i03).
    3. M. Koutras & V. Alexandrou, 1995. "Runs, scans and URN model distributions: A unified Markov chain approach," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(4), pages 743-766, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ioannis Kontoyiannis & Lambros Mertzanis & Athina Panotopoulou & Ioannis Papageorgiou & Maria Skoularidou, 2022. "Bayesian context trees: Modelling and exact inference for discrete time series," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(4), pages 1287-1323, September.
    2. Serkan Eryilmaz, 2005. "On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials," Statistical Papers, Springer, vol. 46(1), pages 117-128, January.
    3. Markos V. Koutras & Demetrios P. Lyberopoulos, 2018. "Asymptotic results for jump probabilities associated to the multiple scan statistic," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(5), pages 951-968, October.
    4. Lou, W. Y. Wendy, 2003. "The exact distribution of the k-tuple statistic for sequence homology," Statistics & Probability Letters, Elsevier, vol. 61(1), pages 51-59, January.
    5. Sigeo Aki & Katuomi Hirano, 2002. "On Waiting Time for Reversed Patterns in Random Sequences," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 54(4), pages 713-718, December.
    6. Stathis Chadjiconstantinidis & Serkan Eryilmaz, 2023. "Computing waiting time probabilities related to $$ (k_{1},k_{2},\ldots ,k_{l})$$ ( k 1 , k 2 , … , k l ) pattern," Statistical Papers, Springer, vol. 64(5), pages 1373-1390, October.
    7. Shinde, R.L. & Kotwal, K.S., 2006. "On the joint distribution of runs in the sequence of Markov-dependent multi-state trials," Statistics & Probability Letters, Elsevier, vol. 76(10), pages 1065-1074, May.
    8. Spiros D. Dafnis & Frosso S. Makri & Markos V. Koutras, 2021. "Generalizations of Runs and Patterns Distributions for Sequences of Binary Trials," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 165-185, March.
    9. Kiyoshi Inoue & Sigeo Aki, 2013. "Distributions of numbers of runs and scans on directed acyclic graphs with generation," Computational Statistics, Springer, vol. 28(3), pages 1133-1150, June.
    10. Sigeo Aki, 1999. "Distributions of Runs and Consecutive Systems on Directed Trees," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 51(1), pages 1-15, March.
    11. Yong Kong, 2019. "Decoupling Combinatorial Complexity: a Two-Step Approach to Distributions of Runs," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 789-803, September.
    12. Spiros D. Dafnis & Frosso S. Makri, 2023. "Distributions Related to Weak Runs With a Minimum and a Maximum Number of Successes: A Unified Approach," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-24, March.
    13. A. Godbole & M. Koutras & F. Milienos, 2011. "Binary consecutive covering arrays," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 63(3), pages 559-584, June.
    14. Yi-Shen Lin & Xenos Chang-Shuo Lin & Daniel Wei-Chung Miao & Yi-Ching Yao, 2020. "Corrected Discrete Approximations for Multiple Window Scan Statistics of One-Dimensional Poisson Processes," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 237-265, March.
    15. Yong Kong, 2017. "The mth longest runs of multivariate random sequences," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 69(3), pages 497-512, June.
    16. M. Koutras, 1996. "On a waiting time distribution in a sequence of Bernoulli trials," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 48(4), pages 789-806, December.
    17. Han, Qing & Aki, Sigeo, 1998. "Formulae and recursions for the joint distributions of success runs of several lengths in a two-state Markov chain," Statistics & Probability Letters, Elsevier, vol. 40(3), pages 203-214, October.
    18. Yong Kong, 2017. "Number of appearances of events in random sequences: a new generating function approach to Type II and Type III runs," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 69(2), pages 489-495, April.
    19. Spiros D. Dafnis & Frosso S. Makri, 2022. "Weak runs in sequences of binary trials," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(5), pages 573-603, July.
    20. Koutras, M. V. & Alexandrou, V. A., 1997. "Non-parametric randomness tests based on success runs of fixed length," Statistics & Probability Letters, Elsevier, vol. 32(4), pages 393-404, April.

    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:spr:aistmt:v:72:y:2020:i:4:d:10.1007_s10463-019-00714-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.