SachaEpskamp
About
- Username
- SachaEpskamp
- Joined
- Visits
- 17
- Last Active
- Roles
- Member
Comments
-
Hi Chris, The bootstrapping is only used to assess the stability and accuracy of the results, not to estimate the networks themselves. This is why the results are always the same. If you use cross-validation as estimator, the results differ a bit ea…
-
These are bootstrapped confidence intervals on the edge weights. Please see https://link.springer.com/article/10.3758/s13428-017-0862-1 and chapter 8 of: https://www.routledge.com/Network-Psychometrics-with-R-A-Guide-for-Behavioral-and-Social-Scien…
-
Hi! The centrality indices are shown as z-scores by default. You can select "raw" with "centrality measures" to get the raw values! Best, Sacha
-
I'm afraid that JASP does not return the p-values right now. However, the cor_auto function is just a wrapper for the lavaan method, which is also implemented through the SEM module. You can get polychoric/tetracoric correlation estimates with p-val…
-
The input has to be raw data and not a correlation matrix. Inputting a correlation matrix with an added row will give poor results (because that dataset will be treated as raw data). Best, Sacha
-
Hi Kayan, betweenness = 0 is pretty typical for correlation networks, it means that all shortest paths between nodes are the direct edges between the nodes, meaning that no nodes lie on the shortest path. Note that we don't recommend correlation net…
-
Hi Maria, I am not a 100% sure on the expected influence variant used in JASP, but I think it is the implementation form qgraph, which is just the sum of weights without taking the absolute value. I personally think that should only be used in some …
-
Hi Francesco, Indeed, the presence/absence of edges is then based on the model selection routine. The interpretation is a bit similar to significance, as the idea is the same (edges are only included if there is enough evidence to reject the null),…
-
Hi Flora, Yes, the methods discussed in https://link.springer.com/article/10.3758/s13428-017-0862-1 are also included in Jasp! Best, Sacha
-
The degree index is the strength index in weighted graphs. Best, Sacha
-
Hi Anna, The closeness is defined as 1 / <sum of all shortest path lengths from one node to all other nodes> for each node. If you have a disconnected graph, then the path length from the disconnected node to the other nodes is infinite, and 1…
-
Ok it seems this website does not allow me to post links? You can find them on my website at sachaepskamp.com/publications: Epskamp, S., Borsboom, D. & Fried, E.I. Estimating Psychological Networks and their Accuracy: A Tutorial Paper. (2017). …
-
Hm, somehow the links failed... Let's try again! https://link.springer.com/article/10.3758/s13428-017-0862-1 https://arxiv.org/abs/1607.01367
-
Hi Major, I think these are best explained in the following two tutorial papers (the first a bit more depth): https://link.springer.com/article/10.3758/s13428-017-0862-1 https://arxiv.org/abs/1607.01367 The latter is published in Psychological Metho…
-
Hi Jana, Thank you for your enthusiasm! We are working on the help page, which I hope to have in a coming release. The SEM module indeed uses lavaan in the background. You can type the Lavaan syntax in the syntax window and press command-enter (on …