Identifying combinatorially symmetric hidden Markov models

Daniel K. Burgarth*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

A sufficient criterion for the unique parameter identification of combinatorially symmetric Hidden Markov Models, based on the structure of their transition matrix, is provided. If the observed states of the chain form a zero forcing set of the graph of the Markov model, then it is uniquely identifiable and an explicit reconstruction method is given.

Original languageEnglish
Article number30
Pages (from-to)393-398
Number of pages6
JournalElectronic Journal of Linear Algebra
Volume34
DOIs
Publication statusPublished - 21 Feb 2018
Externally publishedYes

Keywords

  • Markov chains
  • zero forcing
  • parameter identification

Fingerprint Dive into the research topics of 'Identifying combinatorially symmetric hidden Markov models'. Together they form a unique fingerprint.

Cite this