.png){kind=icon}
返回
Random Walk on Multiple Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2022.3221668.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited information. In contrast, real data often contain entities with different types or/and from different sources, which are comprehensive and can be better modeled by multiple networks. To take the advantage of rich information in multiple networks and make better inferences on entities, in this study, we propose random walk on multiple networks, RWM. RWM is flexible and supports both multiplex networks and general multiple networks, which may form many-to-many node mappings between networks. RWM sends a random walker on each network to obtain the local proximity (i.e., node visiting probabilities) w.r.t. the starting nodes. Walkers with similar visiting probabilities reinforce each other. We theoretically analyze the convergence properties of RWM. Two approximation methods with theoretical performance guarantees are proposed for efficient computation. We apply RWM in link prediction, network embedding, and local community detection. Comprehensive experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness and efficiency of RWM.
Keyword:
Random walk
complex network
local community detection
link prediction
network embedding
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Mechanical Properties of Concrete with Partial Replacement of Portland Cement by Clay Brick PowderOAAI
OAAI分享收藏Identifying Modular Flows on Multilayer Networks Reveals Highly Overlapping Organization in Interconnected Systems.png)
PHYSICAL REVIEW X
OAAI
PHYSICAL REVIEW XIF15.7
OAAI分享收藏Insurance activity and economic performance: Fresh evidence from asymmetric panel causality testsOAAI
OAAI分享收藏分享收藏
查看更多内容