Determining full conditional independence by low-order conditioning

DOI10.3150/09-BEJ193zbMath1206.60009arXiv0705.1613OpenAlexW2045131719MaRDI QIDQ605892

Dhafer Malouche

Publication date: 15 November 2010

Published in: Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

graphical modelsconditional independenceundirected graphsconcentration graph modelsMarkov propertiesseparability in graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Gaussian covariance faithful Markov trees ⋮ Implications of faithfulness in graphical models

Uses Software

• pcalg
• TETRAD
• MIM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flexible covariance estimation in graphical Gaussian models
• Causation, prediction, and search
• Logical and algorithmic properties of conditional independence and graphical models
• Wishart distributions for decomposable graphs
• Graphical methods for efficient likelihood inference in Gaussian covariance models
• Estimation of a covariance matrix with zeros
• Introduction to Graphical Modelling
• Low-Order Conditional Independence Graphs for Inferring Genetic Networks

This page was built for publication: Determining full conditional independence by low-order conditioning