On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs (Q4221805): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1111/1467-9469.t01-1-00050 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4240430580 / rank | |||
Normal rank |
Latest revision as of 00:56, 20 March 2024
scientific article; zbMATH DE number 1228670
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs |
scientific article; zbMATH DE number 1228670 |
Statements
On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs (English)
0 references
17 August 1999
0 references
graphical model
0 references
conditional independence of random variables
0 references
decomposable graph
0 references