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

Degree-corrected stochastic block models and reliability in networks

Author

Listed:
  • Zhang, Xue
  • Wang, Xiaojie
  • Zhao, Chengli
  • Yi, Dongyun
  • Xie, Zheng

Abstract

Plenty of algorithms for link prediction have been proposed to extract missing information, identify spurious interactions, reconstruct networks, and so on. Stochastic block models are one of the most accurate methods among all of them. However, this algorithm is designed only for simple graphs and ignores the variation in node degree which is typically displayed in real-world networks. In this paper, we propose a corresponding reliable approach based on degree-corrected stochastic block models, which could be applied in networks containing both multi-edges and self-edges. Empirical comparison on five disparate networks shows that the overall performance of our method is better than the original version in predicting missing links, especially for the interactions between high-degree nodes.

Suggested Citation

  • Zhang, Xue & Wang, Xiaojie & Zhao, Chengli & Yi, Dongyun & Xie, Zheng, 2014. "Degree-corrected stochastic block models and reliability in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 393(C), pages 553-559.
    • Handle: RePEc:eee:phsmap:v:393:y:2014:i:c:p:553-559
    DOI: 10.1016/j.physa.2013.08.061
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711300811X
    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.2013.08.061?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. Aaron Clauset & Cristopher Moore & M. E. J. Newman, 2008. "Hierarchical structure and the prediction of missing links in networks," Nature, Nature, vol. 453(7191), pages 98-101, May.
    2. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    3. Zhu, Yu-Xiao & Lü, Linyuan & Zhang, Qian-Ming & Zhou, Tao, 2012. "Uncovering missing links with cold ends," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(22), pages 5769-5778.
    4. Leo Katz, 1953. "A new status index derived from sociometric analysis," Psychometrika, Springer;The Psychometric Society, vol. 18(1), pages 39-43, March.
    5. Tao Zhou & Linyuan Lü & Yi-Cheng Zhang, 2009. "Predicting missing links via local information," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 71(4), pages 623-630, October.
    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. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Xie, Zheng & Zhang, Shengjun & Yi, Dongyun, 2015. "Predicting link directions using local directed path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 260-267.
    2. Huang, Qiangjuan & Zhao, Chengli & Wang, Xiaojie & Zhang, Xue & Yi, Dongyun, 2015. "Predicting the structural evolution of networks by applying multivariate time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 428(C), pages 470-480.

    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. Liao, Hao & Zeng, An & Zhang, Yi-Cheng, 2015. "Predicting missing links via correlation between nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 436(C), pages 216-223.
    2. 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.
    3. Lee, Yan-Li & Zhou, Tao, 2021. "Collaborative filtering approach to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 578(C).
    4. Liu, Shuxin & Ji, Xinsheng & Liu, Caixia & Bai, Yi, 2017. "Extended resource allocation index for link prediction of complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 174-183.
    5. Sherkat, Ehsan & Rahgozar, Maseud & Asadpour, Masoud, 2015. "Structural link prediction based on ant colony approach in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 80-94.
    6. Aziz, Furqan & Gul, Haji & Muhammad, Ishtiaq & Uddin, Irfan, 2020. "Link prediction using node information on local paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    7. Kumar, Ajay & Singh, Shashank Sheshar & Singh, Kuldeep & Biswas, Bhaskar, 2020. "Link prediction techniques, applications, and performance: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    8. Chunning Wang & Fengqin Tang & Xuejing Zhao, 2023. "LPGRI: A Global Relevance-Based Link Prediction Approach for Multiplex Networks," Mathematics, MDPI, vol. 11(14), pages 1-15, July.
    9. Wu, Jiehua & Shen, Jing & Zhou, Bei & Zhang, Xiayan & Huang, Bohuai, 2019. "General link prediction with influential node identification," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 996-1007.
    10. Xu-Wen Wang & Lorenzo Madeddu & Kerstin Spirohn & Leonardo Martini & Adriano Fazzone & Luca Becchetti & Thomas P. Wytock & István A. Kovács & Olivér M. Balogh & Bettina Benczik & Mátyás Pétervári & Be, 2023. "Assessment of community efforts to advance network-based prediction of protein–protein interactions," Nature Communications, Nature, vol. 14(1), pages 1-14, December.
    11. 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.
    12. Pei, Panpan & Liu, Bo & Jiao, Licheng, 2017. "Link prediction in complex networks based on an information allocation index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 470(C), pages 1-11.
    13. Wu, Tao & Chen, Leiting & Zhong, Linfeng & Xian, Xingping, 2017. "Predicting the evolution of complex networks via similarity dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 662-672.
    14. Zhou, Tao & Lee, Yan-Li & Wang, Guannan, 2021. "Experimental analyses on 2-hop-based and 3-hop-based link prediction algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    15. Wang, Xiaojie & Zhang, Xue & Zhao, Chengli & Xie, Zheng & Zhang, Shengjun & Yi, Dongyun, 2015. "Predicting link directions using local directed path," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 260-267.
    16. Park, Ji Hwan & Chang, Woojin & Song, Jae Wook, 2020. "Link prediction in the Granger causality network of the global currency market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 553(C).
    17. Lee, Yan-Li & Dong, Qiang & Zhou, Tao, 2021. "Link prediction via controlling the leading eigenvector," Applied Mathematics and Computation, Elsevier, vol. 411(C).
    18. Wang, Jun & Zhang, Qian-Ming & Zhou, Tao, 2019. "Tag-aware link prediction algorithm in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 105-111.
    19. Ma, Xiaoke & Sun, Penggang & Wang, Yu, 2018. "Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 121-136.
    20. Liu, Yangyang & Zhao, Chengli & Wang, Xiaojie & Huang, Qiangjuan & Zhang, Xue & Yi, Dongyun, 2016. "The degree-related clustering coefficient and its application to link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 454(C), pages 24-33.

    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:393:y:2014:i:c:p:553-559. 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.