Leave-one-out testing for node-level differences in Gaussian graphical models
Davide Benussi, Ester Alongi, Erika Banzato
TL;DR
This paper addresses two-sample equality testing in Gaussian graphical models by proposing node-level inference through a leave-one-out Bartlett-adjusted global LRT on a fully connected graph. The method forms leave-one-out increments $\Delta_M$ whose null distribution is a chi-square with degrees of freedom $h(l,p)=\frac{l(2p-l+3)}{2}$, enabling calibrated p-values for single nodes and fixed-size subsets; singleton tests yield $\Delta_j \sim \chi^2_{p+1}$ under $H_0$. Multiplicity is managed via Holm adjustments to identify altered nodes, and under alternatives the increments exhibit noncentral chi-square behavior, providing power. Simulations show accurate finite-sample calibration and favorable power properties, while the approach remains computationally light and practically useful, with a proposed two-stage strategy to localize changes within a clique when the true graph is unknown. The work advances localized, valid inference in GGMs beyond decomposable-graph restrictions and suggests future extensions to robustness and unbalanced designs.
Abstract
We study two-sample equality testing in Gaussian graphical models. Classical likelihood ratio tests on decomposable graphs admit clique-wise factorizations, offering limited localization and unstable finite-sample behaviour. We propose node-level inference via a leave-one-out Bartlett-adjusted test on a fully connected graph. The resulting increments have standard chi-square null limits, enabling calibrated significance for single nodes and fixed-size subsets. Simulations confirm validity, and a case study shows practical utility.
