A graphical characterization of the largest chain graphs (Q1807602)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graphical characterization of the largest chain graphs |
scientific article; zbMATH DE number 1367617
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A graphical characterization of the largest chain graphs |
scientific article; zbMATH DE number 1367617 |
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
0 references
0 references
0 references
0.8535171151161194
0 references
0.8225888609886169
0 references
0.8023708462715149
0 references
