Network Mapping by Replaying Hyperbolic Growth

Recent years have shown a promising progress in understanding geometric underpinnings behind the structure, function, and dynamics of many complex networks in nature and society. However, these promises cannot be readily fulfilled and lead to important practical applications, without a simple, reliable, and fast network mapping method to infer the latent geometric coordinates of nodes in a real network. Here, we present HyperMap, a simple method to map a given real network to its hyperbolic space. The method utilizes a recent geometric theory of complex networks modeled as random geometric graphs in hyperbolic spaces. The method replays the network's geometric growth, estimating at each time-step the hyperbolic coordinates of new nodes in a growing network by maximizing the likelihood of the network snapshot in the model. We apply HyperMap to the Autonomous Systems (AS) Internet and find that: 1) the method produces meaningful results, identifying soft communities of ASs belonging to the same geographic region; 2) the method has a remarkable predictive power: Using the resulting map, we can predict missing links in the Internet with high precision, outperforming popular existing methods; and 3) the resulting map is highly navigable, meaning that a vast majority of greedy geometric routing paths are successful and low-stretch. Even though the method is not without limitations, and is open for improvement, it occupies a unique attractive position in the space of tradeoffs between simplicity, accuracy, and computational complexity.

[1]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[2]  Charles Elkan,et al.  Link Prediction via Matrix Factorization , 2011, ECML/PKDD.

[3]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[4]  Jon M. Kleinberg,et al.  The link-prediction problem for social networks , 2007, J. Assoc. Inf. Sci. Technol..

[5]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[6]  Yuval Shavitt,et al.  On Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction , 2007 .

[7]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[8]  Francis Bonahon.  Low-Dimensional Geometry , 2009 .

[9]  S. Bornholdt,et al.  Handbook of Graphs and Networks , 2012 .

[10]  Ted G. Lewis,et al.  Network Science: Theory and Applications , 2009 .

[11]  Dmitri Krioukov,et al.  Internet Mapping: From Art to Science , 2009, 2009 Cybersecurity Applications & Technology Conference for Homeland Security.

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

[13]  Purnamrita Sarkar,et al.  Theoretical Justification of Popular Link Prediction Heuristics , 2011, IJCAI.

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

[15]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Dmitri V. Krioukov,et al.  AS relationships: inference and validation , 2006, CCRV.

[17]  Dmitri V. Krioukov,et al.  Replaying the geometric growth of complex networks and application to the AS internet , 2012, PERV.

[18]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[19]  Peng Xie,et al.  Sampling biases in IP topology measurements , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[21]  Amogh Dhamdhere,et al.  Twelve Years in the Evolution of the Internet Ecosystem , 2011, IEEE/ACM Transactions on Networking.

[22]  M. Gromov.  Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[23]  Marián Boguñá,et al.  Self-similarity of complex networks and hidden metric spaces , 2007, Physical review letters.

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

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

[26]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[27]  Sergey N. Dorogovtsev,et al.  Lectures on Complex Networks , 2010 .

[28]  Ted G. Lewis,et al.  Network Science: Theory and Practice , 2009 .

[29]  Gerard T. Barkema,et al.  Monte Carlo Methods in Statistical Physics , 1999 .

[30]  M. Newman,et al.  Hierarchical structure and the prediction of missing links in networks , 2008, Nature.

[31]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

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