### Abstract

We prove that a tree model is an exponential family (e-family) of Markov kernels, if and only if it is an FSMX model. The notion of e-family of Markov kernels was first introduced by Nakagawa and Kanaya ('93) in the one-dimensional case. Then, Nagaoka ('05) gave its established form, and Hayashi & Watanabe ('16) discussed it. A tree model is the Markov model defined by a context tree. It is noted by Weinberger et al., ('95) that tree models are classified into two classes; FSMX models and non-FSMX models, depending on the shape of their context trees. The FSMX model is a tree model and a finite state machine. We further show that, for Markov models, the e-family of Markov kernels is equivalent to the asymptotic e-family, which was introduced by Takeuchi & Barron ('98). Note that Takeuchi & Kawabata ('07) proved that non-FSMX tree models are not asymptotic e-families for the binary alphabet case. This paper enhances their result and reveals the information geometrical properties of tree models.

Original language | English |
---|---|

Title of host publication | 2017 IEEE Information Theory Workshop, ITW 2017 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 429-433 |

Number of pages | 5 |

ISBN (Electronic) | 9781509030972 |

DOIs | |

Publication status | Published - Jan 31 2018 |

Event | 2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China Duration: Nov 6 2017 → Nov 10 2017 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

Volume | 2018-January |

ISSN (Print) | 2157-8095 |

### Other

Other | 2017 IEEE Information Theory Workshop, ITW 2017 |
---|---|

Country | Taiwan, Province of China |

City | Kaohsiung |

Period | 11/6/17 → 11/10/17 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Information geometry of the family of Markov kernels defined by a context tree'. Together they form a unique fingerprint.

## Cite this

*2017 IEEE Information Theory Workshop, ITW 2017*(pp. 429-433). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITW.2017.8278008