2020
DOI: 10.31234/osf.io/236w8
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Meta-analytic Gaussian Network Aggregation

Abstract: A growing number of publications focuses on estimating Gaussian graphical models (GGMs, networks of partial correlation coefficients). At the same time, generalizibility and replicability of these highly parameterized models are debated, and sample sizes typically found in datasets may not be sufficient for estimating the underlying network structure. In addition, while recent work emerged that aims to compare networks based on different samples, these studies do not take potential cross-study heterogeneity in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
44
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
4

Relationship

3
6

Authors

Journals

citations
Cited by 22 publications
(46 citation statements)
references
References 56 publications
1
44
1
Order By: Relevance
“…All statistical analyses were conducted in the R statistical software version 4.1.0 (R Core Team, 2015), using the MAGNA framework implemented in the R package psychonetrics version 0.7.5. (Epskamp, 2020). We employed a random-effects MAGNA model using an averaged individual estimate of the sampling variation matrix.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…All statistical analyses were conducted in the R statistical software version 4.1.0 (R Core Team, 2015), using the MAGNA framework implemented in the R package psychonetrics version 0.7.5. (Epskamp, 2020). We employed a random-effects MAGNA model using an averaged individual estimate of the sampling variation matrix.…”
Section: Discussionmentioning
confidence: 99%
“…That is, if a network is estimated from a single sample, would similar conclusions be drawn from the resulting network structure? To this end, for each correlation matrix (Pearson correlations obtained through listwise deletion), we estimated network models using four techniques that allow for correlation matrices to be used as input: (1) the EBICglasso algorithm (Epskamp & Fried, 2018), which combines the graphical LASSO (Friedman et al, 2008) regularization with model selection using the extended Bayesian information criterion (EBIC; Foygel & Drton, 2010) and is estimated through using the EBICglasso function in the qgraph package (Epskamp et al, 2012), (2) unthresholded partial correlation estimation using the qgraph package, (3) the ggmModSelect algorithm using the qgraph package (Isvoranu et al, 2019), which performs extensive stepwise unregularized model search, and (4) pruning at = 0.05 using the psychonetrics package (Epskamp, 2020;, which is similar to the method used for estimating the pooled network structure except that it is only applied to a single study and does not take study-heterogeneity into account. We compared how well on average parameter estimates, as well as model selection compare to the pooled MAGNA network.…”
Section: Conflict Of Interestmentioning
confidence: 99%
“…Specifically, the sample sizes used when estimating each pairwise correlation separately are computed, and the average of these is taken as the final sample size in the analyses. Second, the psychonetrics package includes full information maximum likelihood estimation (Epskamp, Isvoranu, & Cheung, 2020), which will only use observed data to estimate the GGM structure.…”
Section: Unstable Network Structuresmentioning
confidence: 99%
“…This section describes how we generated data used in the simulation study. Given a GGM structure encoded in a square matrix (a matrix with zeroes on the diagonal and partial correlation coefficients on the off-diagonal elements), we first transformed this matrix into an expected correlation matrix using the following expression (Epskamp et al, 2020;Epskamp, Rhemtulla, et al, 2017):…”
Section: Fundingmentioning
confidence: 99%