Fig. 4
From: Manifold learning and maximum likelihood estimation for hyperbolic network embedding
Benchmarking on real networks. a Connection probabilities as a function of hyperbolic distances measured with the coordinates inferred by each method. b Greedy routing efficiency when the inferred hyperbolic coordinates are used as addresses to send packets between 1000 randomly selected source-target pairs. c Hop stretch of successful packet deliveries for the considered source-target pairs. Red diamonds indicate the average hop stretch. d Time needed by each method to embed each real network to hyperbolic space