Author
Listed:
- Cong Li
(School of Cyber Engineering, Xidian University, Xi’an 710126, P. R. China)
- Yuhan Cao
(School of Cyber Engineering, Xidian University, Xi’an 710126, P. R. China)
- Ying Zhao
(��School of Cyber Science and Engineering, Southeast University, Nanjing 211102, P. R. China‡Purple Mountain Laboratories, Nanjing 211111, P. R. China)
- Xingxing Liao
(��Purple Mountain Laboratories, Nanjing 211111, P. R. China)
- Zilong Wang
(School of Cyber Engineering, Xidian University, Xi’an 710126, P. R. China)
- Meng Zhang
(�Department of Physical Education, Xidian University, Xi’an 710126, P. R. China)
- Jian Tao
(��Purple Mountain Laboratories, Nanjing 211111, P. R. China)
Abstract
Complex systems are prevalent in nature, and link prediction is crucial for analyzing these systems. This method has gained attention for its ability to uncover various irregular movements with underlying similarities. While individual particle behavior is unpredictable, the collective behavior of large groups can be forecasted more accurately. The variability at lower scales vs universal similarities at higher scales is often overlooked. To address this, we investigate the random walk process on directed networks at a global scale. We propose an improved link prediction method using biased random walks to enhance accuracy and applicability. We first define out-degree neighbors as valid transmission options to prevent conflicts with in-degree paths. We then analyze how out-degrees and in-degrees affect particle transition probabilities, guiding particles toward high out-degrees and low in-degrees for a sustainable process. Finally, we use particle stabilization probabilities at different nodes as a similarity measure for predicting potential connections. Our method improves prediction precision and practicality, as validated by experiments on nine real-world networks, showing significant gains in accuracy and AUC scores.
Suggested Citation
Cong Li & Yuhan Cao & Ying Zhao & Xingxing Liao & Zilong Wang & Meng Zhang & Jian Tao, 2025.
"A novel high applicability link prediction based on biased random walks,"
International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-21, June.
Handle:
RePEc:wsi:ijmpcx:v:36:y:2025:i:06:n:s0129183124502462
DOI: 10.1142/S0129183124502462
Download full text from publisher
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:wsi:ijmpcx:v:36:y:2025:i:06:n:s0129183124502462. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.