Towards standard imsets for maximal ancestral graphs
From MaRDI portal
Publication:6565312
DOI10.3150/23-BEJ1663zbMATH Open1548.60037MaRDI QIDQ6565312FDOQ6565312
Authors: Zhongyi Hu, Robin J. Evans
Publication date: 2 July 2024
Published in: Bernoulli (Search for Journal in Brave)
Recommendations
- Standard imsets for undirected and chain graphical models
- Graphical and algebraic representatives of conditional independence models
- On the Markov equivalence of maximal ancestral graphs
- The hidden life of latent variables: Bayesian learning with mixed graph models
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
graphical modelsstandard imsetmaximal ancestral graphscharacteristic imsetordered local Markov property
Probabilistic graphical models (62H22) Directed graphs (digraphs), tournaments (05C20) Combinatorial probability (60C05)
Cites Work
- Title not available (Why is that?)
- Ancestral graph Markov models.
- Computing maximum likelihood estimates in recursive linear models with correlated errors
- Title not available (Why is that?)
- Markov Properties for Acyclic Directed Mixed Graphs
- 10.1162/153244303321897717
- Markovian acyclic directed mixed graphs for discrete data
- Markov properties for mixed graphs
- Three Counter-Examples on Semi-Graphoids
- Model selection and local geometry
- Marginal Log-Linear Parameters for Graphical Markov Models
- Nested Markov properties for acyclic directed mixed graphs
- Standard imsets for undirected and chain graphical models
This page was built for publication: Towards standard imsets for maximal ancestral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565312)