A Note on Cyclic Graphs and Dynamical Feedback Systems

Thomas S. Richardson, Peter Spirtes, Clark Glymour
Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics, PMLR R1:421-428, 1997.

Abstract

Directed acyclic graphical (DAG) models were motivated in large part by the desire to have a general formalism to represent causal hypotheses and the restrictions on probability distributions they imply. DAG models exploited a fundamental kinship in a variety of statistical formalisms often treated as distinct "models": factor models, structural equation models, regression models, logistic regression models, survival models, etc. The fundamental connection is through either of two equivalent (for DAGs) properties, a "local" Markov condition, or the property of d-separation, sometimes called the "global" Markov condition. (Pearl 1988, Lauritzen et al. 1990). In much the same spirit, directed cyclic graphs (DCGs) have been introduced to represent the causal ·structure of feedback processes and the restrictions on probability distributions those structures imply. Developments in our understanding of DCGs have proceeded so rapidly that it is appropriate to consider the prospects and limitations of cyclic representations of feedback systems. (For an alternative approach to extending graphical models to the temporal domain see Aliferis and Cooper, 1996)

Cite this Paper

BibTeX
@InProceedings{pmlr-vR1-richardson97b, title = {A Note on Cyclic Graphs and Dynamical Feedback Systems}, author = {Richardson, Thomas S. and Spirtes, Peter and Glymour, Clark}, booktitle = {Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics}, pages = {421--428}, year = {1997}, editor = {Madigan, David and Smyth, Padhraic}, volume = {R1}, series = {Proceedings of Machine Learning Research}, month = {04--07 Jan}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/r1/richardson97b/richardson97b.pdf}, url = {https://proceedings.mlr.press/r1/richardson97b.html}, abstract = {Directed acyclic graphical (DAG) models were motivated in large part by the desire to have a general formalism to represent causal hypotheses and the restrictions on probability distributions they imply. DAG models exploited a fundamental kinship in a variety of statistical formalisms often treated as distinct "models": factor models, structural equation models, regression models, logistic regression models, survival models, etc. The fundamental connection is through either of two equivalent (for DAGs) properties, a "local" Markov condition, or the property of d-separation, sometimes called the "global" Markov condition. (Pearl 1988, Lauritzen et al. 1990). In much the same spirit, directed cyclic graphs (DCGs) have been introduced to represent the causal ·structure of feedback processes and the restrictions on probability distributions those structures imply. Developments in our understanding of DCGs have proceeded so rapidly that it is appropriate to consider the prospects and limitations of cyclic representations of feedback systems. (For an alternative approach to extending graphical models to the temporal domain see Aliferis and Cooper, 1996)}, note = {Reissued by PMLR on 30 March 2021.} }
Endnote
%0 Conference Paper %T A Note on Cyclic Graphs and Dynamical Feedback Systems %A Thomas S. Richardson %A Peter Spirtes %A Clark Glymour %B Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 1997 %E David Madigan %E Padhraic Smyth %F pmlr-vR1-richardson97b %I PMLR %P 421--428 %U https://proceedings.mlr.press/r1/richardson97b.html %V R1 %X Directed acyclic graphical (DAG) models were motivated in large part by the desire to have a general formalism to represent causal hypotheses and the restrictions on probability distributions they imply. DAG models exploited a fundamental kinship in a variety of statistical formalisms often treated as distinct "models": factor models, structural equation models, regression models, logistic regression models, survival models, etc. The fundamental connection is through either of two equivalent (for DAGs) properties, a "local" Markov condition, or the property of d-separation, sometimes called the "global" Markov condition. (Pearl 1988, Lauritzen et al. 1990). In much the same spirit, directed cyclic graphs (DCGs) have been introduced to represent the causal ·structure of feedback processes and the restrictions on probability distributions those structures imply. Developments in our understanding of DCGs have proceeded so rapidly that it is appropriate to consider the prospects and limitations of cyclic representations of feedback systems. (For an alternative approach to extending graphical models to the temporal domain see Aliferis and Cooper, 1996) %Z Reissued by PMLR on 30 March 2021.
APA
Richardson, T.S., Spirtes, P. & Glymour, C.. (1997). A Note on Cyclic Graphs and Dynamical Feedback Systems. Proceedings of the Sixth International Workshop on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research R1:421-428 Available from https://proceedings.mlr.press/r1/richardson97b.html. Reissued by PMLR on 30 March 2021.

Related Material