Standard imsets for undirected and chain graphical models

DOI10.3150/14-BEJ611zbMATH Open1356.60016arXiv1102.2927MaRDI QIDQ2515506FDOQ2515506

Authors: Takuya Kashimura, Akimichi Takemura 

Publication date: 5 August 2015

Published in: Bernoulli (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1102.2927

Recommendations

• Graphical and algebraic representatives of conditional independence models
• A reconstruction algorithm for the essential graph
• Publication:3198595
• The characteristic imset polytope of Bayesian networks with ordered nodes
• On chain graph models for description of conditional independence structures

zbMATH Keywords

conditional independencetriangulationdecomposable graphmaximal prime subgraph

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cites Work

• Efficient algorithms for conditional independence inference
• Title not available (Why is that?)
• Logical and algorithmic properties of conditional independence and graphical models
• On chain graph models for description of conditional independence structures
• Optimal decomposition by clique separators
• Minimal triangulations of graphs: a survey
• A reconstruction algorithm for the essential graph
• Title not available (Why is that?)
• Three Counter-Examples on Semi-Graphoids
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• Independence properties of directed markov fields
• A geometric view on learning Bayesian network structures
• A localization approach to improve iterative proportional scaling in Gaussian graphical models
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Graphical and algebraic representatives of conditional independence models
• Two operations of merging and splitting components in a chain graph
• Characteristic imsets for learning Bayesian network structure
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts¹

Cited In (2)

• Towards standard imsets for maximal ancestral graphs
• The characteristic imset polytope of Bayesian networks with ordered nodes

This page was built for publication: Standard imsets for undirected and chain graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515506)