EIGENnet
Convenience function for converting a qgraph object to an eigenmodel layout
EIGENnet(qgraph_net, EIGENadj = NULL, S = 1000, burn = 200, seed = 1, repulse = F, repulsion = 1, eigenmodelArgs = list(), ...)
qgraph_net |
an object of type |
EIGENadj |
to use a base matrix for the eigenmodel other than the adjacency matrix
stored in |
S |
number of samples from the Markov chain |
burn |
number of initial scans of the Markov chain to be dropped |
seed |
a random seed |
repulse |
logical. Add a small repulsion force with wordcloud package to avoid node overlap? |
repulsion |
scalar for the repulsion force (if repulse=T). Larger values add more repulsion |
eigenmodelArgs |
additional arguments in list format passed to |
... |
additional arguments passed to |
An eigenmodel can be interpreted based on coordinate placement of each node. A node in the top right corner scored high on both the first and second latent components
Jones, P. J., Mair, P., & McNally, R. J. (2018). Visualizing psychological networks: A tutorial in R. Frontiers in Psychology, 9, 1742. https://doi.org/10.3389/fpsyg.2018.01742
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.