Random hyperbolic graphs with arbitrary mesoscale structures.

Abstract

Real-world networks exhibit universal structural properties such as sparsity, small worldness, heterogeneous degree distributions, high clustering, and community structures. Geometric network models, particularly random hyperbolic graphs (RHGs), effectively capture many of these features by embedding nodes in a latent similarity space. However, networks are often characterized by specific connectivity patterns between groups of nodes-i.e., communities-that are not geometric, in the sense that the dissimilarity between groups does not obey the triangle inequality. Structuring connections only based on the interplay of similarity and popularity thus poses fundamental limitations on the mesoscale structure of the networks that RHGs can generate. To address this limitation, we introduce the random hyperbolic block model (RHBM), which extends RHGs by incorporating block structures within a maximum-entropy framework. We demonstrate the advantages of RHBM through synthetic network analyses, highlighting its ability to preserve community structures where purely geometric models fail. Our findings emphasize the importance of latent geometry in network modeling while addressing its limitations in controlling mesoscale mixing patterns.