A General Solution for Network Models with Pairwise Edge Coupling

Abstract

Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution to this family of Random Graph Models extending previous results obtained for specific interaction structures. We use the Hubbard-Stratonovich transform to show that such higher order models can be decoupled into families of effectively separable random graph models, which might be enhanced with auxiliary, possibly multi-valued, parameters identifying the thermodynamical phase of the system. Moreover, given the diagonalizability of couplings between links, we carry out the full computation of the partition functions and discuss why in some cases they can effectively reduce to the one for the Mean-Field case.