Causal network learning with non-invertible functional relationships

Bingling Wang and Qing Zhou

Computational Statistics & Data Analysis, 2021, vol. 156, issue C

Abstract: Discovery of causal relationships from observational data is an important problem in many areas. Several recent results have established the identifiability of causal directed acyclic graphs (DAGs) with non-Gaussian and/or nonlinear structural equation models (SEMs). Focusing on nonlinear SEMs defined by non-invertible functions, which exist in many data domains, a novel test is proposed for non-invertible bivariate causal models. Algorithms are further developed to incorporate this test in structure learning of DAGs that contain both linear and nonlinear causal relations. Extensive numerical comparisons show that the proposed algorithms outperform existing DAG learning methods in identifying causal graphical structures. The practical application of the methods is illustrated by learning causal networks for combinatorial binding of transcription factors from ChIP-Seq data.

Keywords: Causal discovery; Directed acyclic graph; Structural equation model; Nonlinearity; Non-invertible relation (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167947320302322
Full text for ScienceDirect subscribers only.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:csdana:v:156:y:2021:i:c:s0167947320302322

DOI: 10.1016/j.csda.2020.107141

Access Statistics for this article

Computational Statistics & Data Analysis is currently edited by S.P. Azen

More articles in Computational Statistics & Data Analysis from Elsevier
Bibliographic data for series maintained by Catherine Liu ().