Faithfulness in chain graphs: the discrete case
type: Item
instance of: scholarly article
title: Faithfulness in chain graphs: the discrete case
zbMATH Open document ID: 1416.62376
published in: International Journal of Approximate Reasoning
publication date: 2010-04-07T00:00:00Z
Mathematics Subject Classification ID: 62H99
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 62H20
zbMATH DE Number: 5690201
zbMATH Keywords: chain graphs
zbMATH Keywords: faithfulness
zbMATH Keywords: Markov equivalence
zbMATH Keywords: factorization equivalence
zbMATH Keywords: largest chain graphs
author: Jose M. Peña
MaRDI profile type: Publication
full work available at URL: j.ijar.2009.06.006
OpenAlex ID: W2125260318
cites work: Q4092750
cites work: Q3198595
cites work: Q4382293
cites work: Distinctness of the eigenvalues of a quadratic form in a multivariate sample
cites work: An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
cites work: Q4663408
cites work: On chain graph models for description of conditional independence structures
cites work: Q3637504
DOI: 10.1016/J.IJAR.2009.06.006
Recommended article: Faithfulness and learning hypergraphs from discrete distributions
Recommended article: Q3490019
Recommended article: Faithfulness of Probability Distributions and Graphs
Recommended article: Counterexamples to conjectures for uniformly optimally reliable graphs.
Recommended article: Reliabilities of Consecutive-2 Graphs
Recommended article: Integrity of total graphs via certain parameters
Recommended article: On an Invariant of Graphs and the Reliability Polynomial
Recommended article: Faithful 1-edge fault tolerant graphs
Recommended article: Implications of faithfulness in graphical models
Recommended article: Chain graph interpretations and their relations revisited
description: scientific article; zbMATH DE number 5690201