Network Psychometrics in R
EGAnet represents a set of measured variables as a network and estimates how many dimensions organize it. The package is built around reproducible code and visualizations suitable for publication.
The function map
From raw items to a finished network model, every stage of the EGA workflow is its own set of composable functions.
itemStability() · invariance() · net.loads() · UVA() · CFA()
simEGM() — simulate from the Exploratory Graph Model
Version 2.5.0
community.detection and community.consensus now use {EGAnet}'s own C implementation of the Louvain algorithm (louvain.c) instead of igraph::cluster_louvain.
community.prism implements Pairwise Resolution Iteration via Subgraph Modularity (PRISM), iteratively testing pairwise unions of communities for a modularity gain at the subgraph level and merging communities whenever the union increases modularity relative to their separate memberships; intended to overcome the modularity resolution limit described by Fortunato and Barthelemy (2007)