Identifying combinatorially symmetric Hidden Markov Models

Main Article Content

Daniel Burgarth

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.

Article Details

Section
Article