Skip to main content


Weitere Artikel dieser Ausgabe durch Wischen aufrufen

01.12.2016 | Research | Ausgabe 1/2016 Open Access

Applied Network Science 1/2016

Manifold learning and maximum likelihood estimation for hyperbolic network embedding

Applied Network Science > Ausgabe 1/2016
Gregorio Alanis-Lobato, Pablo Mier, Miguel A. Andrade-Navarro
Wichtige Hinweise

Electronic supplementary material

The online version of this article (doi:10.​1007/​s41109-016-0013-0) contains supplementary material, which is available to authorized users.


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 seek to form ties, not only with the most connected (popular) system components, but also with those that are similar to them. This model has a geometric interpretation in hyperbolic space, where distances between nodes abstract popularity-similarity trade-offs and the formation of scale-free and strongly clustered networks can be accurately described.
Current methods for mapping networks to hyperbolic space are based on maximum likelihood estimations or manifold learning. The former approach is very accurate but slow; the latter improves efficiency at the cost of accuracy. Here, we analyse the strengths and limitations of both strategies and assess the advantages of combining them to efficiently embed big networks, allowing for their examination from a geometric perspective. Our evaluations in artificial and real networks support the idea that hyperbolic distance constraints play a significant role in the formation of edges between nodes. This means that challenging problems in network science, like link prediction or community detection, could be more easily addressed under this geometric framework.
Additional file 1 Supplementary information. (PDF 539 kb)
Über diesen Artikel

Weitere Artikel der Ausgabe 1/2016

Applied Network Science 1/2016 Zur Ausgabe

Premium Partner