A characterization of Markov equivalence for directed cyclic graphs

DOI10.1016/S0888-613X(97)00020-0zbMath0939.68095arXiv1302.3600MaRDI QIDQ1809370

Yanyan Li

Publication date: 20 December 1999

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.3600

zbMATH Keywords

\(d\)-separationacyclic directed graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99)

Related Items (4)

Graphical modeling of stochastic processes driven by correlated noise ⋮ Totally ordered conditional independence models ⋮ Inferring large graphs using \(\ell_1\)-penalized likelihood ⋮ Computation of maximum likelihood estimates in cyclic structural equation models

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Causation, prediction, and search
• Markov properties of nonrecursive causal models
• Independence properties of directed markov fields
• A Note on the Statistical Testability of 'Explicit Causal Chains' Against the Class of 'Interdependent' Models
• The Statistical Implications of a System of Simultaneous Equations

This page was built for publication: A characterization of Markov equivalence for directed cyclic graphs