IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v455y2016icp104-119.html
   My bibliography  Save this article

Hyperbolic mapping of complex networks based on community information

Author

Listed:
  • Wang, Zuxi
  • Li, Qingguang
  • Jin, Fengdong
  • Xiong, Wei
  • Wu, Yao

Abstract

To improve the hyperbolic mapping methods both in terms of accuracy and running time, a novel mapping method called Community and Hyperbolic Mapping (CHM) is proposed based on community information in this paper. Firstly, an index called Community Intimacy (CI) is presented to measure the adjacency relationship between the communities, based on which a community ordering algorithm is introduced. According to the proposed Community-Sector hypothesis, which supposes that most nodes of one community gather in a same sector in hyperbolic space, CHM maps the ordered communities into hyperbolic space, and then the angular coordinates of nodes are randomly initialized within the sector that they belong to. Therefore, all the network nodes are so far mapped to hyperbolic space, and then the initialized angular coordinates can be optimized by employing the information of all nodes, which can greatly improve the algorithm precision. By applying the proposed dual-layer angle sampling method in the optimization procedure, CHM reduces the time complexity to O(n2). The experiments show that our algorithm outperforms the state-of-the-art methods.

Suggested Citation

  • Wang, Zuxi & Li, Qingguang & Jin, Fengdong & Xiong, Wei & Wu, Yao, 2016. "Hyperbolic mapping of complex networks based on community information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 455(C), pages 104-119.
    • Handle: RePEc:eee:phsmap:v:455:y:2016:i:c:p:104-119
    DOI: 10.1016/j.physa.2016.02.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116001813
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2016.02.015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fragkiskos Papadopoulos & Maksim Kitsak & M. Ángeles Serrano & Marián Boguñá & Dmitri Krioukov, 2012. "Popularity versus similarity in growing networks," Nature, Nature, vol. 489(7417), pages 537-540, September.
    2. Ma, Lili & Jiang, Xin & Wu, Kaiyuan & Zhang, Zhanli & Tang, Shaoting & Zheng, Zhiming, 2012. "Surveying network community structure in the hidden metric space," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 371-378.
    3. Marián Boguñá & Fragkiskos Papadopoulos & Dmitri Krioukov, 2010. "Sustaining the Internet with hyperbolic mapping," Nature Communications, Nature, vol. 1(1), pages 1-8, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Jichao & Ge, Bingfeng & Yang, Kewei & Chen, Yingwu & Tan, Yuejin, 2017. "Meta-path based heterogeneous combat network link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 482(C), pages 507-523.
    2. Moradi, Mehdi & Parsa, Saeed, 2019. "An evolutionary method for community detection using a novel local search strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 457-475.
    3. Yin, Likang & Zheng, Haoyang & Bian, Tian & Deng, Yong, 2017. "An evidential link prediction method and link predictability based on Shannon entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 482(C), pages 699-712.
    4. Yao, Yabing & Zhang, Ruisheng & Yang, Fan & Tang, Jianxin & Yuan, Yongna & Hu, Rongjing, 2018. "Link prediction in complex networks based on the interactions among paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 52-67.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Maksim Kitsak & Alexander Ganin & Ahmed Elmokashfi & Hongzhu Cui & Daniel A. Eisenberg & David L. Alderson & Dmitry Korkin & Igor Linkov, 2023. "Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping," Nature Communications, Nature, vol. 14(1), pages 1-9, December.
    2. Robert Jankowski & Antoine Allard & Marián Boguñá & M. Ángeles Serrano, 2023. "The D-Mercator method for the multidimensional hyperbolic embedding of real networks," Nature Communications, Nature, vol. 14(1), pages 1-11, December.
    3. Jascha-Alexander Koch & Michael Siering, 2019. "The recipe of successful crowdfunding campaigns," Electronic Markets, Springer;IIM University of St. Gallen, vol. 29(4), pages 661-679, December.
    4. Chen, Ling-Jiao & Zhang, Zi-Ke & Liu, Jin-Hu & Gao, Jian & Zhou, Tao, 2017. "A vertex similarity index for better personalized recommendation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 466(C), pages 607-615.
    5. Wang, Zuxi & Wu, Yao & Li, Qingguang & Jin, Fengdong & Xiong, Wei, 2016. "Link prediction based on hyperbolic mapping with community structure for complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 609-623.
    6. Ma, Lili & Jiang, Xin & Wu, Kaiyuan & Zhang, Zhanli & Tang, Shaoting & Zheng, Zhiming, 2012. "Surveying network community structure in the hidden metric space," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(1), pages 371-378.
    7. Wang, Zuxi & Li, Qingguang & Xiong, Wei & Jin, Fengdong & Wu, Yao, 2016. "Fast community detection based on sector edge aggregation metric model in hyperbolic space," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 452(C), pages 178-191.
    8. Antoine Allard & M Ángeles Serrano, 2020. "Navigable maps of structural brain networks across species," PLOS Computational Biology, Public Library of Science, vol. 16(2), pages 1-20, February.
    9. Martin Keller-Ressel & Stephanie Nargang, 2020. "The hyperbolic geometry of financial networks," Papers 2005.00399, arXiv.org, revised May 2020.
    10. Weihua Yang & David Rideout, 2020. "High Dimensional Hyperbolic Geometry of Complex Networks," Mathematics, MDPI, vol. 8(11), pages 1-39, October.
    11. Kelly B. Yancey & Matthew P. Yancey, 0. "Bipartite communities via spectral partitioning," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-34.
    12. Zhenpeng Li & Luo Li, 2023. "The Generation Mechanism of Degree Distribution with Power Exponent >2 and the Growth of Edges in Temporal Social Networks," Mathematics, MDPI, vol. 11(13), pages 1-11, June.
    13. Maksim Kitsak & Ahmed Elmokashfi & Shlomo Havlin & Dmitri Krioukov, 2015. "Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    14. Jhun, Bukyoung & Jo, Minjae & Kahng, B., 2022. "Quantum contact process on scale-free networks," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    15. Hou, Lei & Liu, Kecheng & Liu, Jianguo & Zhang, Runtong, 2017. "Solving the stability–accuracy–diversity dilemma of recommender systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 468(C), pages 415-424.
    16. Pu, Jia & Jia, Tao & Li, Ya, 2019. "Effects of time cost on the evolution of cooperation in snowdrift game," Chaos, Solitons & Fractals, Elsevier, vol. 125(C), pages 146-151.
    17. Meng, Fanyuan & Zhu, Jiadong & Yao, Yuheng & Fenoaltea, Enrico Maria & Xie, Yubo & Yang, Pingle & Liu, Run-Ran & Zhang, Jianlin, 2023. "Disagreement and fragmentation in growing groups," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).
    18. Xie, Zheng & Ouyang, Zhenzheng & Li, Jianping, 2016. "A geometric graph model for coauthorship networks," Journal of Informetrics, Elsevier, vol. 10(1), pages 299-311.
    19. Meliksah Turker & Haluk O. Bingol, 2023. "Multi-layer network approach in modeling epidemics in an urban town," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 96(2), pages 1-13, February.
    20. Fan, Dongmei & Jiang, Guo-Ping & Song, Yu-Rong & Li, Yin-Wei, 2020. "Novel fake news spreading model with similarity on PSO-based networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 549(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:455:y:2016:i:c:p:104-119. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.