Ancestral graph Markov models
Abstract
This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of vertices; every missing edge corresponds to an independence relation. These features lead to a simple parameterization of the corresponding set of distributions in the Gaussian case.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The Markov equivalence class of a MAG can be represented uniquely by a partial ancestral graph (PAG).
“Again, there is an identifiability problem here, as we can generally only identify the Markov equivalence class of the underlying MAG, which can be represented uniquely by a partial ancestral graph (PAG) [Richardson and Spirtes (2002), Ali, Richardson and Spirtes (2009)].”
From A generalized back-door criterion (2015) · cites this paper as Richardson and Spirtes (2002)
Cited by
Sorted by citations
A New Criterion for Confounder Selection
VanderWeele, T. J., & Shpitser, I. (2011) · Biometrics · doi:10.1111/j.1541-0420.2011.01619.x · Cited by 434 · see citing works
Causal discovery and inference: concepts and recent methodological advances
Spirtes, P., & Zhang, K. (2016) · Applied Informatics · doi:10.1186/s40535-016-0018-x · Cited by 304 · see citing works
Self-citationBayesian networks for fMRI: A primer
Mumford, J. A., & Ramsey, J. D. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2013.10.020 · Cited by 132 · see citing works
Learning Functional Causal Models with Generative Neural Networks
Goudet, O., Kalainathan, D., Caillou, P., Guyon, I., Lopez-Paz, D., & Sebag, M. (2018) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-319-98131-4_3 · Cited by 123 · see citing works
A generalized back-door criterion
Maathuis, M. H., & Colombo, D. (2015) · The Annals of Statistics · doi:10.1214/14-aos1295 · Cited by 88 · see citing works
“Moreover, combining our results for CPDAGs and PAGs with fast causal structure learning algorithms such as the PC algorithm (Spirtes et al. (2000)) or the FCI algorithm (Claassen et al.”
BackgroundMethodInfluentialCausal Structure Learning: A Combinatorial Perspective
Squires, C., & Uhler, C. (2023) · Foundations of Computational Mathematics · doi:10.1007/s10208-022-09581-9 · Cited by 31 · see citing works
- Authors
- Richardson, T., & Spirtes, P.
- Affiliations
- University of Washington (US)
- Florida Institute for Human and Machine Cognition (US)
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2002-08-01
- Volume
- 30
- Issue
- 4
- Pages
- 962-1030
- ISSN
- 0090-5364 (ISSN-L)
- 2168-8966
- OpenAlex
- W2086331397
- Cited by
- 545
- References
- 0
- Citations by year
- 2026: 20 · 2025: 19 · 2024: 26 · 2023: 26 · 2022: 23 · 2021: 30 · 2020: 39 · 2019: 29 · 2018: 29 · 2017: 30 · 2016: 23 · 2015: 28 · 2014: 31 · 2013: 28 · 2012: 41
- FWCI
- 6.23
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- The Annals of Statistics (publishedVersion)
- Defense Technical Information Center (DTIC) (submittedVersion)
- Project Euclid (Cornell University) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Gaussian Processes and Bayesian Inference
- Keywords
- Markov model, missing edges, normal distribution
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review