IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v39y2024i2d10.1007_s00180-023-01334-8.html
   My bibliography  Save this article

A comprehensive framework for link prediction in multiplex networks

Author

Listed:
  • Fengqin Tang

    (Huaibei Normal University)

  • Cuixia Li

    (Xuzhou University of Technology)

  • Chungning Wang

    (Lanzhou University of Finance and Economics)

  • Yi Yang

    (Huaibei Normal University)

  • Xuejing Zhao

    (Lanzhou University)

Abstract

The idea of predicting links in multiplex networks has gained increasing interest in recent years. In this paper, we propose a comprehensive framework which benefits from the structural information of auxiliary layers to predict links on a target layer of multiplex networks. Specifically, we assume that the likelihood of the existence of a link between two nodes is determined by the contributions from both the nodes’ neighbors on the target layer and their counterparts’ neighbors on a manually network generated by auxiliary layers. The final likelihood matrix is acquired by an iterative algorithm. In addition, we show advantages of our methods for predicting links on sparse and dense networks as well as on networks with assortative and disassortative structural layers. The effectiveness of the proposed methods are evaluated through extensive experiments on real-world multiplex networks.

Suggested Citation

  • Fengqin Tang & Cuixia Li & Chungning Wang & Yi Yang & Xuejing Zhao, 2024. "A comprehensive framework for link prediction in multiplex networks," Computational Statistics, Springer, vol. 39(2), pages 939-961, April.
    • Handle: RePEc:spr:compst:v:39:y:2024:i:2:d:10.1007_s00180-023-01334-8
    DOI: 10.1007/s00180-023-01334-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-023-01334-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-023-01334-8?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.

    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:spr:compst:v:39:y:2024:i:2:d:10.1007_s00180-023-01334-8. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.