Computational methods for a copula-based Markov chain model with a binomial time series

Xin Wei Huang, Takeshi Emura*

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

1 Scopus citations

Abstract

A copula-based Markov chain model can flexibly capture serial dependence in a time series. However, the computational developments for copula-based Markov models remain insufficient for discrete marginal models compared with continuous ones. In this article, we develop computational methods for a binomial time series under the Clayton and Joe copulas. The methods include the data-generation, parameter estimation, model selection, and goodness-of-fit tests. We implement the methods in our R package Copula.Markov (https://CRAN.R-project.org/package=Copula.Markov). We conduct simulations to see the performance of the developed methods. Finally, the proposed method is illustrated by a real dataset.

Original languageEnglish
Pages (from-to)1973-1990
Number of pages18
JournalCommunications in Statistics: Simulation and Computation
Volume53
Issue number4
DOIs
StatePublished - 2024
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2022 Taylor & Francis Group, LLC.

Keywords

  • Binomial distribution
  • Clayton copula
  • Discrete-valued time series
  • Goodness-of-fit
  • Maximum likelihood estimation
  • Serial dependence

Fingerprint

Dive into the research topics of 'Computational methods for a copula-based Markov chain model with a binomial time series'. Together they form a unique fingerprint.

Cite this