Random Walk Algorithms
Random Walk Algorithms is a computational method in network-based repurposing that models traversal processes over biological networks by simulating stochastic paths to prioritize candidate nodes based on their connectivity and proximity to known disease-associated entities.
755
Publications
51.8K
Citations
2.1K
Authors
794
Institutions
Publications per year
2017–2026
225
Parents
755
Random Walks on Graphs: A Survey
László Lovász · 2001 · 1.4K citations
Fugao Wang, D. P. Landau · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · 2001 · 1.2K citations · Full text
1–5 of 755
2.1K
9
h-index
9
h-index
8
h-index
7
h-index
7
h-index
1–5 of 2.1K
794
Chinese University of Hong Kong
Hong Kong, Hong Kong
16 h-index
33 publications
1.6K citations
Tsinghua University
Beijing, China
15 h-index
64 publications
2.1K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
20 publications
2.5K citations

Peking University
Beijing, China
13 h-index
42 publications
1.6K citations
Georgia Institute of Technology
Atlanta, United States
12 h-index
21 publications
3.2K citations
University of Illinois Urbana-Champaign
Urbana, United States
12 h-index
29 publications
1.7K citations
Google (United States)
Mountain View, United States
12 h-index
17 publications
887 citations
Microsoft (United States)
Redmond, United States
11 h-index
13 publications
709 citations
1–8 of 794
Repository · 25 publications · 783 citations
16
h-index
PVLDB · 12 publications · 735 citations
12
h-index
PRE · 12 publications · 658 citations
11
h-index
TKDE · 10 publications · 1.8K citations
10
h-index
9 publications · 360 citations
9
h-index
1–5