Abstract
We want to recover the transition kernel P of a Markov chain X when only a sub-sequence of X is available. The time gaps between the observations are iid with unknown distribution. We propose a method to build an estimator of P under the assumption that it has some zero entries. Its asymptotic performance is discussed in theory and through numerical simulations.
| Original language | English |
|---|---|
| Pages (from-to) | 98-105 |
| Number of pages | 8 |
| Journal | Statistics and Probability Letters |
| Volume | 94 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
| Externally published | Yes |
Keywords
- Asymptotic normality
- Identifiability
- Lie bracket
- Parametric estimation
- Sparse transition matrix
- Time varying Markov process
Fingerprint
Dive into the research topics of 'Estimating the transition matrix of a Markov chain observed at random times'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver