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.

arXiv comment13 pages, 9 figures, uses RevTeX 4.2

References in corpus (21)

• The large-scale organization of metabolic networks
• Dynamical and correlation properties of the Internet
• Growing Scale-Free Networks with Tunable Clustering
• The statistical mechanics of networks
• Random graphs with clustering
• Triadic closure as a basic generating mechanism of communities in complex networks
• Estimating and understanding exponential random graph models
• Solution of the 2-star model of a network
• Robustness of Trans-European Gas Networks
• Solution for the properties of a clustered network
• Network Transitivity and Matrix Models
• Statistical mechanics of topological phase transitions in networks
• Eigenvalue tunnelling and decay of quenched random networks
• A density functional theory for general hard-core lattice gases
• Clustering Phase Transitions and Hysteresis: Pitfalls in Constructing Network Ensembles
• Phase transitions in social networks inspired by the Schelling model
• Cluster density functional theory for lattice models based on the theory of Mobius functions
• Islands of stability in motif distributions of random networks
• Imaginary replica analysis of loopy regular random graphs
• A detailed investigation into near degenerate exponential random graphs
• Exactly Solvable Random Graph Ensemble with Extensively Many Short Cycles