A graphical characterization of the largest chain graphs (Q1807602): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:46, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graphical characterization of the largest chain graphs |
scientific article |
Statements
A graphical characterization of the largest chain graphs (English)
0 references
8 May 2000
0 references
Chain graphs are graphical models of conditional independence structures of random variables. A characterization of largest chain graphs is given and an algorithm is described and used to generate all largest chain graphs with at most five vertices.
0 references
Markov equivalence
0 references
graphical models
0 references
largest chain graphs
0 references
