Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane

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.

[1]  A. Vázquez.  Growing network with local rules: preferential attachment, clustering hierarchy, and degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Michel BodeNikolaos FountoulakisTobias Muller,et al.  The probability that the hyperbolic random graph is connected , 2014 .

[3]  Dmitri V. Krioukov,et al.  Network Mapping by Replaying Hyperbolic Growth , 2012, IEEE/ACM Transactions on Networking.

[4]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[5]  Henning Meyerhenke,et al.  Generating Random Hyperbolic Graphs in Subquadratic Time , 2015, ISAAC.

[6]  Stephen G. Kobourov,et al.  Non-Euclidean Spring Embedders , 2004, IEEE Symposium on Information Visualization.

[7]  Yuval Shavitt,et al.  Hyperbolic embedding of internet graph for distance estimation and overlay construction , 2008, TNET.

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  Tamara Munzner,et al.  Exploring Large Graphs in 3D Hyperbolic Space , 1998, IEEE Computer Graphics and Applications.

[10]  Chiara Orsini,et al.  Hyperbolic graph generator , 2015, Comput. Phys. Commun..

[11]  Marián Boguñá,et al.  Sustaining the Internet with Hyperbolic Mapping , 2010, Nature communications.

[12]  Cosma Rohilla Shalizi,et al.  Geometric Network Comparisons , 2015, UAI.

[13]  Tobias Friedrich,et al.  Cliques in hyperbolic random graphs , 2015, INFOCOM.

[14]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[15]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, KDD 2012.

[16]  Dmitri V. Krioukov,et al.  Network Geometry Inference using Common Neighbors , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Qingguang Li,et al.  Hyperbolic mapping of complex networks based on community information , 2016 .

[18]  Jörg A. Walter.  H-MDS: a new approach for interactive visualization with multidimensional scaling in the hyperbolic space , 2004, Inf. Syst..

[19]  Kilian Q. Weinberger,et al.  Unsupervised Learning of Image Manifolds by Semidefinite Programming , 2004, CVPR.

[20]  F. Chung,et al.  Connected Components in Random Graphs with Given Expected Degree Sequences , 2002 .

[21]  Ramana Rao,et al.  The Hyperbolic Browser: A Focus + Context Technique for Visualizing Large Hierarchies , 1996, J. Vis. Lang. Comput..

[22]  Helge J. Ritter,et al.  On interactive visualization of high-dimensional data using the hyperbolic plane , 2002, KDD.

[23]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[24]  Nikolaos Fountoulakis,et al.  On the giant component of random hyperbolic graphs , 2013 .

[25]  Subhash Suri,et al.  Metric Embedding, Hyperbolic Space, and Social Networks , 2014, Symposium on Computational Geometry.

[26]  Trevor F. Cox,et al.  Multidimensional Scaling, Second Edition , 2000 .

[27]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[28]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[29]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[30]  Tim S. Evans,et al.  Embedding graphs in Lorentzian spacetime , 2016, PloS one.

[31]  Ilkka Norros,et al.  On a conditionally Poissonian graph process , 2006, Advances in Applied Probability.

[32]  Ramana Rao,et al.  A focus+context technique based on hyperbolic geometry for visualizing large hierarchies , 1995, CHI '95.

[33]  Johannes Lengler,et al.  Bootstrap percolation on geometric inhomogeneous random graphs , 2016, ICALP.

[34]  Vasileios Karyotis,et al.  A hyperbolic space analytics framework for big network data and their applications , 2016, IEEE Network.

[35]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[37]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  Tobias Friedrich,et al.  On the Diameter of Hyperbolic Random Graphs , 2015, ICALP.

[39]  Luca Gugelmann,et al.  Random Hyperbolic Graphs: Degree Sequence and Clustering , 2012, ArXiv.

[40]  Ben Y. Zhao,et al.  Efficient shortest paths on massive social graphs , 2011, 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom).