Standard imsets for undirected and chain graphical models

DOI10.3150/14-BEJ611zbMath1356.60016arXiv1102.2927MaRDI QIDQ2515506

Akimichi Takemura, Takuya Kashimura

Publication date: 5 August 2015

Published in: Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

triangulationconditional independencedecomposable graphmaximal prime subgraph

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal triangulations of graphs: a survey
• A reconstruction algorithm for the essential graph
• A geometric view on learning Bayesian network structures
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• 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
• Characteristic imsets for learning Bayesian network structure
• Three Counter-Examples on Semi-Graphoids
• A Localization Approach to Improve Iterative Proportional Scaling in Gaussian Graphical Models
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Independence properties of directed markov fields
• DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts¹