Open Access
August 2015 Standard imsets for undirected and chain graphical models
Takuya Kashimura, Akimichi Takemura
Bernoulli 21(3): 1467-1493 (August 2015). DOI: 10.3150/14-BEJ611

Abstract

We derive standard imsets for undirected graphical models and chain graphical models. Standard imsets for undirected graphical models are described in terms of minimal triangulations for maximal prime subgraphs of the undirected graphs. For describing standard imsets for chain graphical models, we first define a triangulation of a chain graph. We then use the triangulation to generalize our results for the undirected graphs to chain graphs.

Citation

Download Citation

Takuya Kashimura. Akimichi Takemura. "Standard imsets for undirected and chain graphical models." Bernoulli 21 (3) 1467 - 1493, August 2015. https://doi.org/10.3150/14-BEJ611

Information

Received: 1 February 2011; Revised: 1 January 2014; Published: August 2015
First available in Project Euclid: 27 May 2015

zbMATH: 1356.60016
MathSciNet: MR3352051
Digital Object Identifier: 10.3150/14-BEJ611

Keywords: Conditional independence , decomposable graph , maximal prime subgraph , Triangulation

Rights: Copyright © 2015 Bernoulli Society for Mathematical Statistics and Probability

Vol.21 • No. 3 • August 2015
Back to Top