Minimal Markov model for a set of Markov chains

Jesus Garcia

  • Date: 14 JUNE 2019  at 14:00

  • Event location: TBA

  • Type: Statistics Seminars

Abstract:

In this paper, we define a family of Markov models for a set of Markov chains over the same finite alphabet A and develop a model selection procedure for this family of models. The methodology is based on the Bayesian Information Criterion (BIC) by Schwarz. The procedure consists of identifying all the elements on the state spaces of the Markov chains having the same transition probabilities. This identification allows us to build a partition of the set of state spaces, such that two states are in the same part if and only if they have equal transition probabilities. Formulating the joint model in this way, the number of parameters is minimized since for each part we need (|A|-1) parameters. The joint model developed here is a generalization of the partition Markov models by García and González-López.

References:

García, Jesús E.; Gholizadeh, R.; González-López, V. A.
A BIC-based consistent metric between Markovian processes. 
APPLIED STOCHASTIC MODELS IN BUSINESS AND INDUSTRY. , v.1, p.11 - , 2018.

García, Jesús E.; González-López, V. A.
Consistent Estimation of Partition Markov Models. 
Entropy. , v.19, p.160 - , 2017.

 

Organizzatore:

Sabrina Mulinacci