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

@article{Kovcs2022GeneralisedPO,
  title={Generalised popularity-similarity optimisation model for growing hyperbolic networks beyond two dimensions},
  author={Bianka Kov{\'a}cs and S{\'a}muel G. Balogh and Gergely Palla},
  journal={Scientific Reports},
  year={2022},
  volume={12},
  pages={1-15}
}
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… 

Model-independent methods for embedding directed networks into Euclidean and hyperbolic spaces

A framework based on the dimension reduction of proximity matrices reflecting the network topology, coupled with a general conversion method transforming Euclidean node coordinates into hyperbolic ones even for directed networks is proposed.

Maximally modular structure of growing hyperbolic networks

This work shows that for the popularity-similarity optimization model from this family, the generated networks become also extremely modular in the thermodynamic limit, in spite of lacking any explicit community formation mechanism in the model definition.

Random hyperbolic graphs in $d+1$ dimensions

The rescaling of network parameters is found that allows to reduce random hyperbolic graphs of arbitrary dimensionality to a single mathematical framework and indicates that RHGs exhibit similar topological properties, regardless of the dimensionality of their latenthyperbolic spaces.

Model-independent embedding of directed networks into Euclidean and hyperbolic spaces

A framework based on the dimension reduction of proximity matrices reflecting the network topology coupled with a general conversion method transforming Euclidean node coordinates into hyperbolic ones even for directed networks is introduced.

Dimension matters when modeling network communities in hyperbolic spaces

It is shown that there is an important qualitativeerence between the lowest-dimensional model and its higher-dimensional counterparts with respect to how similarity between nodes restricts connection probabilities, and considering only one more dimension allows for more realistic and diverse community structures.

References

SHOWING 1-10 OF 53 REFERENCES

Optimisation of the coalescent hyperbolic embedding of complex networks

This work proposes a further optimisation of the angular coordinates in this framework that seems to reduce the logarithmic loss and increase the greedy routing score of the embedding compared to the original version, thereby adding an extra improvement to the quality of the inferred hyperbolic coordinates.

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).

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.

Manifold learning and maximum likelihood estimation for hyperbolic network embedding

The Popularity-Similarity (PS) model sustains that clustering and hierarchy, properties common to most networks representing complex systems, are the result of an optimisation process in which nodes

Fast hyperbolic mapping based on the hierarchical community structure in complex networks

This work presents a novel fast hyperbolic mapping algorithm called HMCS, which is based on the network evolution model, the community-sector model inhyperbolic space and the hierarchical community structure of complex networks, and finds that HMCS greatly reduces the mapping time complexity and achieves linearity in sparse networks under the premise of ensuring better mapping accuracy.

Low-Temperature Behaviour of Social and Economic Networks

This work defines a generalized ensemble of graphs by introducing the concept of graph temperature, controlling the degree of topological optimization of a network, and suggests that a low graph temperature might be a ubiquitous property of real socio-economic networks, placing conditions on the diffusion of information across these systems.

Popularity versus similarity in growing networks

It is shown that popularity is just one dimension of attractiveness; another dimension is similarity, and a framework in which new connections optimize certain trade-offs between popularity and similarity is developed, instead of simply preferring popular nodes.

Network Mapping by Replaying Hyperbolic Growth

HyperMap is presented, a simple method to map a given real network to its hyperbolic space and has a remarkable predictive power: Using the resulting map, it can predict missing links in the Internet with high precision, outperforming popular existing methods.

Generalised thresholding of hidden variable network models with scale-free property

This work proposes a relaxation of the hard threshold in the connection probabilities, which opens up the possibility for obtaining sparse scale free networks with arbitrary scaling exponent, and analyze the conditions leading to the above behavior analytically.

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.
...