• Corpus ID: 237374441

Perturbation graphs, invariant prediction and causal relations in psychology

  title={Perturbation graphs, invariant prediction and causal relations in psychology},
  author={Lourens J. Waldorp and Jolanda Jacqueline Kossakowski and H.L.J. van der Maas},
Networks (graphs) in psychology are often restricted to settings without interventions. Here we consider a framework borrowed from biology that involves multiple interventions from different contexts (observations and experiments) in a single analysis. The method is called perturbation graphs. In gene regulatory networks, the induced change in one gene is measured on all other genes in the analysis, thereby assessing possible causal relations. This is repeated for each gene in the analysis. A… 

Figures from this paper


The search for causality: A comparison of different techniques for causal inference graphs.
This study considers the conditions where estimating causal relations might work and shows how well different algorithms, namely the Peter and Clark algorithm, the Downward Ranking of Feed-Forward Loops algorithm, and the Transitive Reduction for Weighted Signed Digraphs algorithm determine causal relations in a simulation study.
Reconstruction of large-scale regulatory networks based on perturbation graphs and transitive reduction: improved methods and their evaluation
The novel methods introduced herein can be seen as state of the art for inference techniques relying on perturbation graphs and transitive reduction, leading to significantly improved performances.
TRANSWESD: inferring cellular networks with transitive reduction
TransWESD is presented, an elaborated variant of TRANSitive reduction for WEighted Signed Digraphs that overcomes conceptual problems of existing versions and is, despite its conceptual simplicity, highly competitive with other reverse engineering methods.
Methods for causal inference from gene perturbation experiments and validation
The results suggest that prediction and prioritization of future experimental interventions, such as gene deletions, can be improved by using the statistical inference techniques used in this work.
Joint Causal Inference from Multiple Contexts
This work introduces Joint Causal Inference, a novel approach to causal discovery from multiple data sets from different contexts that elegantly unifies both approaches and concludes that JCI implementations can considerably outperform state-of-the-art causal discovery algorithms.
Robust network inference using response logic
A logic programming approach that can infer networks of hundreds of nodes, while being robust to noisy, heterogeneous or missing data, and allows to directly integrate prior network knowledge and additional constraints such as sparsity.
From Knockouts to Networks: Establishing Direct Cause-Effect Relationships through Graph Analysis
An inference algorithm that combines confidence matrices, computed as the standard scores from single-gene knockout data, with the down-ranking of feed-forward edges, is proposed, proving to be effective in inferring medium-size gene regulatory networks.
Causal inference in statistics: An overview
This review presents empiricalresearcherswith recent advances in causal inference, and stresses the paradigmatic shifts that must be un- dertaken in moving from traditionalstatistical analysis to
BACKSHIFT: Learning causal cyclic graphs from unknown shift interventions
A simple method to learn linear causal cyclic models in the presence of latent variables that only uses second moments of the data and performs simple joint matrix diagonalization, applied to differences between covariance matrices.
Reconstructing biological networks using conditional correlation analysis
A network reconstruction algorithm based on the conditional correlation of the mRNA equilibrium concentration between two genes given that one of them was knocked down is proposed, which can reconstruct networks with the topology of the transcriptional regulatory network in Escherichia coli with a reasonably low error rate.