Random Hyperbolic Graphs with Arbitrary Mesoscale Structures

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Guarino, Stefano, Torre, Davide, Mastrostefano, Enrico
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866916775356006400
author Guarino, Stefano
Torre, Davide
Mastrostefano, Enrico
author_facet Guarino, Stefano
Torre, Davide
Mastrostefano, Enrico
contents 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 do 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 the 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.
format Preprint
id arxiv_https___arxiv_org_abs_2506_02686
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Random Hyperbolic Graphs with Arbitrary Mesoscale Structures
Guarino, Stefano
Torre, Davide
Mastrostefano, Enrico
Social and Information Networks
Applied Physics
Data Analysis, Statistics and Probability
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 do 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 the 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.
title Random Hyperbolic Graphs with Arbitrary Mesoscale Structures
topic Social and Information Networks
Applied Physics
Data Analysis, Statistics and Probability
url https://arxiv.org/abs/2506.02686