A diffusion-based node ranking algorithm.
收藏数据链接：
官方服务：
资源简介：
A network walker uses a probability diffusion algorithm described in Table 2 to decide which nodes to visit in a network. Starting from a given node, snext, the network walker’s steps are recorded in vns (“visited nodes”). We record the network walker’s visited nodes, vns, for each starting node in S in a hash object, noderanks.
创建时间：
2021-01-29
