Please use this identifier to cite or link to this item:
Title: Network Mapping by Replaying Hyperbolic Growth
Authors: Papadopoulos, Fragkiskos 
Psomas, Constantinos 
Krioukov, Dmitri 
Keywords: Applications;Ιnference;Νetwork geometry
Category: Electrical Engineering - Electronic Engineering - Information Engineering
Field: Engineering and Technology
Issue Date: 1-Feb-2015
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: IEEE/ACM Transactions on Networking, 2015, vol. 23, no. 1, pp. 198-211
Journal: IEEE/ACM Transactions on Networking 
Abstract: 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 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 trade-offs between simplicity, accuracy, and computational complexity.
ISSN: 1063-6692
DOI: 10.1109/TNET.2013.2294052
Rights: © 2014 IEEE.
Type: Article
Appears in Collections:Άρθρα/Articles

Show full item record

Citations 5

checked on Aug 14, 2019

Page view(s) 5

Last Week
Last month
checked on Aug 21, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.