The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Independence properties of directed markov fields
Abstract
We investigate directed Markov fields over finite graphs without positivity assumptions on the densities involved. A criterion for conditional independence of two groups of variables given a third is given and named as the directed, global Markov property. We give a simple proof of the fact that the directed, local Markov property and directed, global Markov property are equivalent and – in the case of absolute continuity w. r. t. a product measure – equivalent to the recursive factorization of densities. It is argued that our criterion is easy to use, it is sharper than that given by Kiiveri, Speed, and Carlin and equivalent to that of Pearl. It follows that our criterion cannot be sharpened.
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
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
Self-citationThe Method of Path Coefficients
Wright, S. (1934) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177732676 · Cited by 2,349
Conditional Independence in Statistical Theory
Dawid, A. P. (1979) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1979.tb01052.x · Cited by 1,501
Self-citationLauritzen, S. L., & Wermuth, N. (1989) · The Annals of Statistics · doi:10.1214/aos/1176347003 · Cited by 672
Self-citationCausal Networks: Semantics and Expressiveness
(1990) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-88650-7.50011-1 · Cited by 357
Graphical and Recursive Models for Contingency Tables
Wermuth, N., & Lauritzen, S. L. (1983) · Biometrika · doi:10.2307/2336490 · Cited by 237
Self-citationKiiveri, H., Speed, T. P., & Carlin, J. B. (1984) · Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics · doi:10.1017/s1446788700027312 · Cited by 213
A Constraint – Propagation Approach to Probabilistic Reasoning
(1986) · Machine Intelligence and Pattern Recognition · doi:10.1016/b978-0-444-70058-2.50031-0 · Cited by 166
Conditional Independence for Statistical Operations
Dawid, A. P. (1980) · The Annals of Statistics · doi:10.1214/aos/1176345011 · Cited by 164
Self-citationThe logic of representing dependencies by directed graphs
Pearl, J., & Verma, T. S. (1987) · National Conference on Artificial Intelligence · Cited by 118
Cited by
WinBUGS - A Bayesian modelling framework: Concepts, structure, and extensibility
Lunn, D. J., Thomas, A., Best, N., & Spiegelhalter, D. (2000) · Statistics and Computing · doi:10.1023/a:1008929526011 · Cited by 5,368
Air Pollution and Hospital Admissions for Heart Disease in Eight U.S. Counties
Schwartz, J. (1999) · Epidemiology · doi:10.1097/00001648-199901000-00005 · Cited by 3,038
Causal diagrams for empirical research
PEARL, J. (1995) · Biometrika · doi:10.1093/biomet/82.4.669 · Cited by 2,355
The BUGS project: evolution, critique and future directions
Lunn, D., Spiegelhalter, D., Thomas, A., & Best, N. (2009) · Statistics in Medicine · doi:10.1002/sim.3680 · Cited by 1,876
Adaptive Computation and Machine Learning
(2012) · Boosting · doi:10.7551/mitpress/8291.003.0026 · Cited by 1,402
Bayesian Graphical Models for Discrete Data
Madigan, D., York, J., & Allard, D. (1995) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403615 · Cited by 1,090
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
The EM algorithm for graphical association models with missing data
Lauritzen, S. L. (1995) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(93)e0056-a · Cited by 760
Self-citationBayesian Analysis in Expert Systems
Spiegelhalter, D. J., Dawid, A. P., Lauritzen, S. L., & Cowell, R. G. (1993) · Statistical Science · doi:10.1214/ss/1177010888 · Cited by 684
Self-citationA Language and Program for Complex Bayesian Modelling
Gilks, W. R., Thomas, A., & Spiegelhalter, D. J. (1994) · The Statistician · doi:10.2307/2348941 · Cited by 653
Bayesian approaches to random-effects meta-analysis: a comparative study
Smith, T. C., Spiegelhalter, D. J., & Thomas, A. (1995) · Statistics in Medicine · doi:10.1002/sim.4780142408 · Cited by 568
Operations for Learning with Graphical Models
Buntine, W. L. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.62 · Cited by 530
Sequential updating of conditional probabilities on directed graphical structures
Spiegelhalter, D. J., & Lauritzen, S. L. (1990) · Networks · doi:10.1002/net.3230200507 · Cited by 521
Self-citationIdentifying independence in bayesian networks
Geiger, D., Verma, T., & Pearl, J. (1990) · Networks · doi:10.1002/net.3230200504 · Cited by 510
Hyper Markov Laws in the Statistical Analysis of Decomposable Graphical Models
Dawid, A. P., & Lauritzen, S. L. (1993) · The Annals of Statistics · doi:10.1214/aos/1176349260 · Cited by 479
Self-citationA guide to the literature on learning probabilistic networks from data
Buntine, W. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.494161 · Cited by 468
Inference in belief networks: A procedural guide
Huang, C., & Darwiche, A. (1996) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(96)00069-2 · Cited by 450
Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
Lauritzen, S. L. (1992) · Journal of the American Statistical Association · doi:10.1080/01621459.1992.10476265 · Cited by 436
Self-citationA New Criterion for Confounder Selection
VanderWeele, T. J., & Shpitser, I. (2011) · Biometrics · doi:10.1111/j.1541-0420.2011.01619.x · Cited by 434
Exploiting Causal Independence in Bayesian Network Inference
Zhang, N. L., & Poole, D. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.305 · Cited by 433
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
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
Causal Inference and Causal Explanation with Background Knowledge
Meek, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4972 · Cited by 371
Data, Design, and Background Knowledge in Etiologic Inference
Robins, J. M. (2001) · Epidemiology · doi:10.1097/00001648-200105000-00011 · Cited by 358
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
A causal mapping approach to constructing Bayesian networks
Nadkarni, S., & Shenoy, P. P. (2004) · Decision Support Systems · doi:10.1016/s0167-9236(03)00095-2 · Cited by 293
Linear Dependencies Represented by Chain Graphs
Cox, D. R., & Wermuth, N. (1993) · Statistical Science · doi:10.1214/ss/1177010887 · Cited by 273
Sensitivity analysis in discrete Bayesian networks
Castillo, E., Gutierrez, J. M., & Hadi, A. S. (1997) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/3468.594909 · Cited by 267
Probabilistic Independence Networks for Hidden Markov Probability Models
Smyth, P., Heckerman, D., & Jordan, M. I. (1997) · Neural Computation · doi:10.1162/neco.1997.9.2.227 · Cited by 257
Influence Diagrams for Causal Modelling and Inference
Dawid, A. P. (2002) · International Statistical Review · doi:10.1111/j.1751-5823.2002.tb00354.x · Cited by 230
Self-citationStrong Completeness and Faithfulness in Bayesian Networks
Meek, C. (2013) · arXiv · doi:10.48550/arxiv.1302.4973 · Cited by 194
Confounding Equivalence in Causal Inference
Pearl, J., & Paz, A. (2014) · Journal of Causal Inference · doi:10.1515/jci-2013-0020 · Cited by 35
Metadata
- Authors
- Lauritzen, S. L., Dawid, A. P., Larsen, B. N., & Leimer, H. ‐.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1990-08
- Volume
- 20
- Issue
- 5
- Pages
- 491-505
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W2013567125
- Cited by
- 515
- References
- 10
- FWCI
- 10.29
- 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
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.