Hyperbolic network models have gained considerable attention in recent years, mainly due to their capability of explaining many peculiar features of real-world networks. One of the most widely known models of this type is the popularity-similarity optimisation (PSO) model, working in the native disk representation of the two-dimensional hyperbolic space and generating networks with small-world property, scale-free degree distribution, high clustering and strong community structure at the same time. With the motivation of better understanding hyperbolic random graphs, we hereby introduce the dPSO model, a generalisation of the PSO model to any arbitrary integer dimension d>2d>2. The analysis of the obtained networks shows that their major st...
The theme of this paper is the study of typical distances in a ran-dom graph model that was introduc...
Abstract One of the pillars of the geometric approach to networks has been the development of model-...
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ...
Hyperbolic network models have gained considerable attention in recent years, mainly due to their ca...
Abstract A remarkable approach for grasping the relevant statistical features of real networks with ...
The investigation of the hidden metric space behind complex network topologies is a fervid topic in ...
Network embedding is a frontier topic in current network science. The scale-free property of complex...
The investigation of the latent geometrical space behind complex network topologies is a fervid topi...
Over the last decade, random hyperbolic graphs have proved successful in providing geometric explana...
Hyperbolic models are remarkably good at reproducing the scale-free, highly clustered and small-worl...
We consider random hyperbolic graphs in hyperbolic spaces of any dimension $d+1 \geq 2$. We present ...
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, wh...
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong ...
Network science is driven by the question which properties large real-world networks have and how we...
peer-reviewedWe show that the community structure of a network can be used as a coarse version of it...
The theme of this paper is the study of typical distances in a ran-dom graph model that was introduc...
Abstract One of the pillars of the geometric approach to networks has been the development of model-...
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ...
Hyperbolic network models have gained considerable attention in recent years, mainly due to their ca...
Abstract A remarkable approach for grasping the relevant statistical features of real networks with ...
The investigation of the hidden metric space behind complex network topologies is a fervid topic in ...
Network embedding is a frontier topic in current network science. The scale-free property of complex...
The investigation of the latent geometrical space behind complex network topologies is a fervid topi...
Over the last decade, random hyperbolic graphs have proved successful in providing geometric explana...
Hyperbolic models are remarkably good at reproducing the scale-free, highly clustered and small-worl...
We consider random hyperbolic graphs in hyperbolic spaces of any dimension $d+1 \geq 2$. We present ...
The hyperbolic random graph model (HRG) has proven useful in the analysis of scale-free networks, wh...
Random graphs with power-law degrees can model scale-free networks as sparse topologies with strong ...
Network science is driven by the question which properties large real-world networks have and how we...
peer-reviewedWe show that the community structure of a network can be used as a coarse version of it...
The theme of this paper is the study of typical distances in a ran-dom graph model that was introduc...
Abstract One of the pillars of the geometric approach to networks has been the development of model-...
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ...