摘要 |
The rank of nodes in a graph may be inferred from a calculated probability that each node in the graph appears in a single random walk of the graph. Short random walks may be generated for each node in the graph. The generated random walks may be combined to form a longer single random walk. Multiple single random walks may be generated in this fashion. The probability of each node appearing in a single random may be calculated from the generated single random walks. The rank of each node may then be inferred from the calculated probabilities.
|