Local structure graph models with higher‐order dependence

Abstract

AbstractLocal structure graph models (LSGMs) describe random graphs and networks as a Markov random field (MRF)—each graph edge has a specified conditional distribution dependent on explicit neighbourhoods of other graph edges. Centred parameterizations of LSGMs allow for direct control and interpretation of parameters for large‐ and small‐scale structures (e.g., marginal means vs. dependence). We extend this parameterization to account for triples of dependent edges and illustrate the importance of centred parameterizations for incorporating covariates and interpreting parameters. Using a MRF framework, common exponential random graph models are also shown to induce conditional distributions without centred parameterizations and thereby have undesirable features. This work attempts to advance graph models through conditional model specifications with modern parameterizations, covariates and higher‐order dependencies.