Bläsius, Thomas
[Author];
Friedrich, Tobias
[Author];
Krohmer, Anton
[Author];
Laue, Sören
[Author]
;
Thomas Bläsius and Tobias Friedrich and Anton Krohmer and Sören Laue
[Contributor]
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
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.