Calculation of Entailed Rank Constraints in Partially Non-Linear and Cyclic Models

Abstract

The Trek Separation Theorem states necessary and sufficient conditions for a linear directed acyclic graphical model to entail for all possible values of its linear coefficients that the rank of various sub-matrices of the covariance matrix is less than or equal to n, for any given n. In this paper, I extend the Trek Separation Theorem in two ways: I prove that the same necessary and sufficient conditions apply even when the generating model is partially non-linear and contains some cycles. This justifies application of constraint-based causal search algorithms to data generated by a wider class of causal models that may contain non-linear and cyclic relations among the latent variables

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,556

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2016-01-30

Downloads
23 (#1,030,017)

6 months
5 (#855,288)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Peter Spirtes
Carnegie Mellon University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references