Simulating Node Manipulations in Gaussian Graphical Models: The GGMNIRA Framework for Continuous and Ordinal Psychological Network Data

2026-07-01

AI Summary

This study addresses a critical limitation in current psychological network analysis, where centrality metrics capture only static topological positions and lack a theoretical foundation for assessing dynamic node influence; moreover, existing intervention methods are confined to binary data. To overcome these constraints, the authors propose the GGMNIRA framework, which extends node manipulation logic from the Ising model to Gaussian graphical models. By intervening on the conditional mean of target nodes and quantifying resulting network distributional shifts via Kullback–Leibler divergence, GGMNIRA enables the evaluation of dynamic node importance in both continuous and ordinal psychological networks. The approach accommodates multi-construct comorbidity networks and moderation analyses, and establishes interpretable effect size benchmarks through nonparametric bootstrap testing, stability coefficients, and simulation-calibrated thresholds. A dedicated R package, “GGMNIRA,” implements the full analytical pipeline.

Abstract

Scientific Abstract: In psychological network analysis, centrality indices are commonly used to evaluate the importance of nodes within a network. However, centrality only captures the static topological position of a node, and there is no sufficient theoretical justification for assuming that it reflects a node's influence on network dynamics. The NodeIdentifyR Algorithm (NIRA) offers an alternative by systematically applying simulated manipulations to node intercepts within the Ising model to evaluate nodes' projected importance, but this algorithm is restricted to binary data, and the manipulated parameter lacks a clear theoretical meaning outside the context of psychopathology. To address these limitations, we propose the Gaussian Graphical Model NodeIdentifyR Algorithm (GGMNIRA), which manipulates a node's conditional mean and uses Kullback-Leibler (KL) divergence to quantify the change in network distribution before and after manipulation, thereby extending this simulated manipulation logic to the Gaussian graphical model framework, which is applicable to continuous and ordinal data. Around this algorithm, we further developed a correlation stability coefficient and a nonparametric bootstrap difference test for KL divergence, with corresponding interpretive thresholds established through simulation studies. The framework was also extended to bridge Gaussian graphical models and moderated Gaussian graphical models, enabling its application to multi-construct comorbidity networks and to contexts involving moderation effects. All methods are implemented in the R package "GGMNIRA".

Problem

• psychological network analysis
• node importance
• Gaussian graphical models
• simulated node manipulation
• ordinal data

Innovation

• Gaussian Graphical Model
• Node Manipulation
• KL Divergence
• Network Centrality
• Moderated GGM