Jump to ContentJump to Main Navigation
Causality in the Sciences$
Users without a subscription are not able to see the full content.

Phyllis McKay Illari, Federica Russo, and Jon Williamson

Print publication date: 2011

Print ISBN-13: 9780199574131

Published to Oxford Scholarship Online: September 2011

DOI: 10.1093/acprof:oso/9780199574131.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 13 October 2019

When are graphical causal models not good models?

When are graphical causal models not good models?

Chapter:
(p.562) 27 When are graphical causal models not good models?
Source:
Causality in the Sciences
Author(s):

Jan Lemeire

Kris Steenhaut

Abdellah Touhafi

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199574131.003.0027

The principle of Kolmogorov minimal sufficient statistic (KMSS) states that the meaningful information of data is given by the regularities in the data. The KMSS is the minimal model that describes the regularities. The meaningful information given by a Bayesian network is the directed acyclic graph (DAG) which describes a decomposition of the joint probability distribution into conditional probability distributions (CPDs). If the description given by the Bayesian network is incompressible, the DAG is the KMSS and is faithful. The chapter proves that if a faithful Bayesian network exists, it is the minimal Bayesian network. Moreover, if a Bayesian network gives the KMSS, modularity of the CPDs is the most plausible hypothesis, from which the causal interpretation follows. On the other hand, if the minimal Bayesian network is compressible and is thus not the KMSS, the above implications cannot be guaranteed. When the non‐minimality of the description is due to the compressibility of an individual CPD, the true causal model is an element of the set of minimal Bayesian networks and modularity is still plausible. Faithfulness cannot be guaranteed though. When the concatenation of the descriptions of the CPDs is compressible, the true causal model is not necessarily an element of the set of minimal Bayesian networks. Also modularity may become implausible. This suggests that either there is a kind of meta‐mechanism governing some of the mechanisms or a wrong model class is considered.

Keywords:   causal models, Bayesian networks, Kolmogorov complexity, Kolmogorov minimal sufficient statistic

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .