On finite exchangeability and conditional independence (Q2192320)
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: On finite exchangeability and conditional independence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finite exchangeability and conditional independence |
scientific article |
Statements
On finite exchangeability and conditional independence (English)
0 references
17 August 2020
0 references
The main result of this article is the following: Theorem. If a distribution \(P\) over an exchangeable random network with \(n\) nodes is faithful to a chain mixed graph \(G\), then \(G\) is Markov equivalent to one of the following graphs: the empty graph, the undirected incidence, the bidirected incidence graph, the undirected complement of the incidence graph, the bidirected complement of the incidence graph, the complete graph.
0 references
exchangeability
0 references
conditional independence
0 references
random networks
0 references
faithfulness
0 references
0 references
0 references
0 references
