Statistical Identification of Markov Chain on Trees

الملخص EN

The theoretical study of continuous-time homogeneous Markov chains is usually based on a natural assumption of a known transition rate matrix (TRM).

However, the TRM of a Markov chain in realistic systems might be unknown and might even need to be identified by partially observable data.

Thus, an issue on how to identify the TRM of the underlying Markov chain by partially observable information is derived from the great significance in applications.

That is what we call the statistical identification of Markov chain.

The Markov chain inversion approach has been derived for basic Markov chains by partial observation at few states.

In the current letter, a more extensive class of Markov chain on trees is investigated.

Firstly, a type of a more operable derivative constraint is developed.

Then, it is shown that all Markov chains on trees can be identified only by such derivative constraints of univariate distributions of sojourn time and/or hitting time at a few states.

A numerical example is included to demonstrate the correctness of the proposed algorithms.