eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2016-08-18
16:1
16:18
10.4230/LIPIcs.ESA.2016.16
article
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
Bläsius, Thomas
Friedrich, Tobias
Krohmer, Anton
Laue, Sören
Hyperbolic geometry appears to be intrinsic in many large real networks. We construct and implement a new maximum likelihood estimation algorithm that embeds scale-free graphs in the hyperbolic space. All previous approaches of similar embedding algorithms require a runtime of Omega(n^2). Our algorithm achieves quasilinear runtime, which makes it the first algorithm that can embed networks with hundreds of thousands of nodes in less than one hour. We demonstrate the performance of our algorithm on artificial and real networks. In all typical metrics like Log-likelihood and greedy routing our algorithm discovers embeddings that are very close to the ground truth.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol057-esa2016/LIPIcs.ESA.2016.16/LIPIcs.ESA.2016.16.pdf
hyperbolic random graphs
embedding
power-law graphs
hyperbolic plane