Link prediction based on hyperbolic mapping with community structure for complex networks

摘要

Link prediction is becoming a concerned topic in the complex network field in recent years. However, the existing link prediction methods are unsatisfactory for processing topological information and have high time complexity. This paper presents a novel method of Link Prediction with Community Structure (LPCS) based on hyperbolic mapping. Different from the existing link prediction methods, to utilize global structure information of the network, LPCS deals with the network from an overall perspective. LPCS takes full advantage of the community structure and its hierarchical organization to map networks into hyperbolic space, and obtains the hyperbolic coordinates which depict the global structure information of the network, then uses hyperbolic distance to describe the similarity between the nodes, finally predicts missing links according to the degree of the similarity between unconnected node pairs. The combination of the hyperbolic geometry framework and the community structure makes LPCS perform well in predicting missing links, and the time complexity of LPCS is linear, which makes LPCS can be applied to handle large scale networks in acceptable time. LPCS outperforms many state-of-the-art link prediction methods in the networks obeying power-law degree distribution. (C) 2016 Elsevier B.V. All rights reserved.