GVARCLUS Procedure

Graphical Representation of Precision Matrix

Elements that have the value 0 in a precision matrix imply conditional independence between variables given the other variables in the network. So the estimate of a precision matrix can recover the conditional independence structure, which can be displayed in an undirected graph. If node upper X Subscript i is connected to node upper X Subscript j by an arc, then upper X Subscript i is called a neighbor of upper X Subscript j. If upper X Subscript i is connected to upper X Subscript k though some chain of arcs, then upper X Subscript i is called a connected component of upper X Subscript k.

The regularization parameter in the penalized log likelihood can be seen as a quasi-measure for the strength of connection between upper X Subscript i and upper X Subscript j, because as lamda increases from small to large, some connections drop out, and the connections that drop out should be weaker than those that stay in.

Last updated: August 06, 2026