Gibbs and Markov properties of graphs
From MaRDI portal
Publication:1370584
DOI10.1023/A:1018948915264zbMATH Open0895.68115OpenAlexW1533258541MaRDI QIDQ1370584FDOQ1370584
Authors: Jan T. A. Koster 
Publication date: 20 September 1998
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018948915264
Recommendations
- Publication:3198595
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- On factorization of probability distributions over directed graphs.
- Conditional independence and basic Markov properties
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
Applications of statistics (62P99) Graph theory (including graph drawing) in computer science (68R10)
Cited In (15)
- Gaussian Markov distributions over finite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On factorization of probability distributions over directed graphs.
- Markov properties for linear causal models with correlated errors
- On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
- Variations on undirected graphical models and their relationships
- Title not available (Why is that?)
- Conditional independence and basic Markov properties
- Markov Graphs
- Markov chains on graphs and Brownian motion
- Stratified exponential families: Graphical models and model selection
- A characterization of moral transitive acyclic directed graph Markov models as labeled trees.
- Markov Properties for Acyclic Directed Mixed Graphs
- Markov properties for mixed graphs
This page was built for publication: Gibbs and Markov properties of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370584)
