2018
DOI: 10.1101/245936
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Causal Discovery of Feedback Networks with Functional Magnetic Resonance Imaging

Abstract: We test the adequacies of several proposed and two new statistical methods for recovering the causal structure of systems with feedback that generate noisy time series closely matching real BOLD time series. We compare: an adaptation for time series of the first correct method for recovering the structure of cyclic linear systems; multivariate Granger causal regression; the GIMME algorithm; the Ramsey et al. non-Gaussian methods; two non-Gaussian methods proposed by Hyvärinen and Smith; a method due to Patel, … Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
17
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(19 citation statements)
references
References 61 publications
0
17
0
Order By: Relevance
“…3C). Again, it was also these p i 0 values that were optimal with regard to the trade-off between sensitivity and specificity of sparse rDCM.Finally, at the request of one reviewer, we compared the performance of sparse rDCM for the original small-world S50 network from Smith et al (2011) to three other methods that infer directed interactions in large-scale brain networks from fMRI data: Multivariate Granger causality (MVGC; Goebel et al, 2003;Roebroeck et al, 2005;Seth, 2010), (ii) Fast Adjacency Skewness (FASK; Sanchez-Romero et al, 2018), and (iii) Fast Greedy Equivalence Search (FGES;Chickering, 2003;Ramsey et al, 2017;Ramsey et al, 2010). In brief, for most settings, sparse rDCM showed comparable or better sensitivity than these approaches.…”
mentioning
confidence: 99%
“…3C). Again, it was also these p i 0 values that were optimal with regard to the trade-off between sensitivity and specificity of sparse rDCM.Finally, at the request of one reviewer, we compared the performance of sparse rDCM for the original small-world S50 network from Smith et al (2011) to three other methods that infer directed interactions in large-scale brain networks from fMRI data: Multivariate Granger causality (MVGC; Goebel et al, 2003;Roebroeck et al, 2005;Seth, 2010), (ii) Fast Adjacency Skewness (FASK; Sanchez-Romero et al, 2018), and (iii) Fast Greedy Equivalence Search (FGES;Chickering, 2003;Ramsey et al, 2017;Ramsey et al, 2010). In brief, for most settings, sparse rDCM showed comparable or better sensitivity than these approaches.…”
mentioning
confidence: 99%
“…The copyright holder for this preprint this version posted October 21, 2021. ; https://doi.org/10.1101/2021.10.20.465211 doi: bioRxiv preprint et al, 2019), these methods have never been used in an applied research context, and often perform worse than the skew-based orientation method we use (Sanchez-Romero et al, 2019). Notably, the GANGO method is capable of discovering 3-cycle or greater feedback loops, so only direct feedback loops remain unmeasured.…”
Section: Discussionmentioning
confidence: 99%
“…For an intuitive information theoretic perspective on how non-Gaussian information can be used to orient edges between pairs of variables, see (Hyvärinen & Smith, 2013). We used a MATLAB implementation of an outlier-robust skew-based measure of the pairwise likelihood ratio (Hyvärinen & Smith, 2013), which has shown to generate optimal estimates of causal direction in simulated fMRI data (Ramsey et al, 2014;Sanchez-Romero et al, 2019). These steps resulted in n = 442 sparse effective connective graphs, which we characterized using various graph theoretic analyses.…”
Section: Construction Of Whole-brain Effective Connectivity Graphsmentioning
confidence: 99%
See 2 more Smart Citations