• Corpus ID: 252367714

Dimension matters when modeling network communities in hyperbolic spaces

  title={Dimension matters when modeling network communities in hyperbolic spaces},
  author={B'eatrice D'esy and Patrick Desrosiers and Antoine Allard},
Over the last decade, random hyperbolic graphs have proved successful in providing geometric explanations to many key properties of real-world networks, including strong clustering, high navigability, and heterogeneous degree distributions. Although a few studies have shown that hyperbolic models can generate community structures, another salient feature observed in real networks, we argue that the current models are overlooking the choice of the latent space dimensionality that is required to… 
1 Citations

Figures from this paper

The low-rank hypothesis of complex systems

This work verifies the low-rank hypothesis for various random networks, and proves that higher-order interactions naturally emerge from the dimension reduction, thus providing theoretical insights into the origin of higher-orders in complex systems.



High Dimensional Hyperbolic Geometry of Complex Networks

This work extends the famous hyperbolic geometric random graph models of Krioukov et al. to arbitrary dimension, providing a detailed analysis of the degree distribution behavior of the model in an expanded portion of the parameter space, considering several regimes which have yet to be considered.

Generalised popularity-similarity optimisation model for growing hyperbolic networks beyond two dimensions

The d PSO model is introduced, a generalisation of the popularity-similarity optimisation model to any arbitrary integer dimension $$d>2$$ d > 2 and shows that their major structural properties can be affected by the dimension of the underlying hyperbolic space in a non-trivial way.

Small worlds and clustering in spatial networks

This work identifies the general subclass of spatial homogeneous and heterogeneous network models that are sparse small worlds and that have nonzero clustering in the thermodynamic limit and relies on the maximum entropy approach.

Characterizing the Analogy Between Hyperbolic Embedding and Community Structure of Complex Networks.

It is shown that the robustness of a multiplex network can be controlled by tuning the correlation between the community structures across different layers, and deploys an efficient greedy protocol for network navigability that makes use of routing tables based on community structure.

Distance Distribution between Complex Network Nodes in Hyperbolic Space

The probability density for the approximate hyperbolic distance between N points, distributed quasi-uniformly at random in a disk of radius R ~ lnN, is determined in this paper, together with other density functions needed to derive this result.

A nonuniform popularity-similarity optimization (nPSO) model to efficiently generate realistic complex networks with communities

The nonuniform PSO (nPSO) model is introduced, which generates synthetic networks in the hyperbolic space where heterogeneous angular node attractiveness is forced by sampling the angular coordinates from a tailored non uniform probability distribution (for instance a mixture of Gaussians).

Self-similarity of complex networks and hidden metric spaces

These findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Angular separability of data clusters or network communities in geometrical space and its relevance to hyperbolic embedding

The angular separation index (ASI) is introduced, to quantitatively evaluate the separation of node network communities or data clusters over the angular coordinates of a geometrical space, and it is shown that ASI allows to discover two significant phenomena in network geometry.

A geometric approach to the structure of complex networks

It is concluded that real-world networks must have low-dimensional similarity spaces as a consequence of their high clustering coefficient, and a Geometric Renormalization Group transformation that unveils a previously unknown self-similarity of real networks is presented.

The geometric nature of weights in real complex networks

This work introduces a very general and versatile model and uses it to quantify the level of coupling between their topology, their weights and an underlying metric space, and suggests that the formation of connections and the assignment of their magnitude are ruled by different processes.