On the interpretation of inflated correlation path weights in concentration graphs

Statistical models associated with graphs, called graphical models, have become a popular tool for representing network structures in many modern applications. Relevant features of the model are represented by vertices, edges and other higher order structures. A fundamental structural component of the network is represented by paths, which are a sequence of distinct vertices joined by a sequence of edges. The collection of all the paths joining two vertices provides a full description of the association structure between the corresponding variables. In this context, it has been shown that certain pairwise association measures can be decomposed into a sum of weights associated with each of the paths connecting the two variables. We consider a pairwise measure called an inflated correlation coefficient and investigate the properties of the corresponding path weights. We show that every inflated correlation weight can be factorized into terms, each of which is associated either to a vertex or to an edge of the path. This factorization allows one to gain insight into the role played by a path in the network by highlighting the contribution to the weight of each of the elementary units forming the path. This is of theoretical interest because, by establishing a similarity between the weights and the association measure they decompose, it provides a justification for the use of these weights. Furthermore we show how this factorization can be exploited in the computation of centrality measures and describe their use with an application to the analysis of a dietary pattern.