358 citations · 1.1k across the 59 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2023
Random Walk on Multiple Networks
Dongsheng Luo, Yuchen Bian, Yaowei Yan +4
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 wal…
cs.SI2022★ 29 cited
Exploring Edge Disentanglement for Node Classification
Tianxiang Zhao, Xiang Zhang, Suhang Wang
Edges in real-world graphs are typically formed by a variety of factors and carry diverse relation semantics. For example, connections in a social network could indicate friendship…