On the Markov equivalence of maximal ancestral graphs (Q2574688)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2234366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Markov equivalence of maximal ancestral graphs |
scientific article; zbMATH DE number 2234366 |
Statements
On the Markov equivalence of maximal ancestral graphs (English)
0 references
30 November 2005
0 references
The paper is devoted to the class of maximal ancestral graphs as an appropriate extention of directed acyclic graphs. The reader may find useful to see the recent paper by \textit{T. S. Richardson} and \textit{P. Spirtes} [Ann. Stat. 30, 962--1030 (2002; Zbl 1033.60008)]. Among the elements of the graphical model is a family of probability functions describing marginal distributions and conditional independence. The goal is to study the relationship between such graphs and in particular to find conditions for a property called Markov equivalence. According to the authors, their results are useful in graphical models, Bayesian networks and exploratory data analysis.
0 references
minimal collider path
0 references
0.9616898
0 references
0.90807843
0 references
0.87314534
0 references
0 references
0.86853087
0 references