The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Alternative Markov Properties for Chain Graphs
Abstract
Graphical Markov models use graphs to represent possible dependences among statistical variables. Lauritzen, Wermuth, and Frydenberg (LWF) introduced a Markov property for chain graphs (CG): graphs that can be used to represent both structural and associative dependences simultaneously and that include both undirected graphs (UG) and acyclic directed graphs (ADG) as special cases. Here an alternative Markov property (AMP) for CGs is introduced and shown to be the Markov property satisfied by a block‐recursive linear system with multivariate normal errors. This model can be decomposed into a collection of conditional normal models, each of which combines the features of multivariate linear regression models and covariance selection models, facilitating the estimation of its parameters. In the general case, necessary and sufficient conditions are given for the equivalence of the LWF and AMP Markov properties of a CG, for the AMP Markov equivalence of two CGs, for the AMP Markov equivalence of a CG to some ADG or decomposable UG, and for other equivalences. For CGs, in some ways the AMP property is a more direct extension of the ADG Markov property than is the LWF property.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425 · cited 16×
“4.2 of Andersson et al. (1997a), G L some ADG need not imply that G A some ADG, nor vice versa.”
BackgroundMethodInfluentialSelf-citation
Cited by
Richardson, T., & Spirtes, P. (2002) · The Annals of Statistics · doi:10.1214/aos/1031689015 · Cited by 545
Lectures on Algebraic Statistics
Drton, M., Sturmfels, B., & Sullivant, S. (2009) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-8905-5 · Cited by 365
Chain Graph Models and their Causal Interpretations
Lauritzen, S. L., & Richardson, T. S. (2002) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00340 · Cited by 265
Metadata
- Authors
- Andersson, S. A., Madigan, D., & Perlman, M. D.
- Venue
- Scandinavian Journal of Statistics
- Publisher
- Wiley
- Published
- 2001-03
- Volume
- 28
- Issue
- 1
- Pages
- 33-85
- ISSN
- 0303-6898 (ISSN-L)
- 1467-9469
- OpenAlex
- W1981599791
- Cited by
- 172
- References
- 1
- FWCI
- 6.38
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Alternative Markov Properties for Chain Graphs. https://app.cochat.ai/papers/10.1111/1467-9469.00224
- The paper
- Andersson, S. A., Madigan, D., & Perlman, M. D. (2001). Alternative Markov Properties for Chain Graphs. Scandinavian Journal of Statistics. https://doi.org/10.1111/1467-9469.00224
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.