Free-energy density functional for Strauss's model of transitive networks

Abstract

Ensemble models of graphs are one of the most important theoretical tools to study complex networks. Among them, exponential random graphs (ERGs) have proven to be very useful in the analysis of social networks. In this paper we develop a technique, borrowed from the statistical mechanics of lattice gases, to solve Strauss's model of transitive networks. This model was introduced long ago as an ERG ensemble for networks with high clustering and exhibits a first-order phase transition above a critical value of the triangle interaction parameter, where two different kinds of networks with different densities of links (or, alternatively, different clustering) coexist. Compared to previous mean-field approaches, our method describes accurately even small networks and can be extended beyond Strauss's classical model -- e.g. to networks with different types of nodes. This allows us to tackle, for instance, models with node homophily. We provide results for the latter and show that they accurately reproduce the outcome of Monte Carlo simulations.

13 pages, 9 figures, uses RevTeX 4.2

References in corpus (6)

• Random graphs with clustering
• Triadic closure as a basic generating mechanism of communities in complex networks
• Robustness of Trans-European Gas Networks
• Solution for the properties of a clustered network
• Eigenvalue tunnelling and decay of quenched random networks
• A density functional theory for general hard-core lattice gases