Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-19T05:38:03.119Z Has data issue: false hasContentIssue false

On equivalence of Markov properties over undirected graphs

Published online by Cambridge University Press:  14 July 2016

F. Matúš*
Affiliation:
Institute of Information Theory and Automation, Prague
*
∗ Postal address: Institute of Information Theory and Automation, Czechoslovak Academy of Sciences, Pod vodárenskou véží 4, 182 08 Prague, Czechoslovakia.

Abstract

The dependence of coincidence of the global, local and pairwise Markov properties on the underlying undirected graph is examined. The pairs of these properties are found to be equivalent for graphs with some small excluded subgraphs. Probabilistic representations of the corresponding conditional independence structures are discussed.

Information

Type
Short Communications
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable