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

Authors

2.1K

  1. CC
    Colin Cooper

    King's College London, United Kingdom

    9 publications · 242 citations

    9

    h-index

  2. GO
    Gareth O. Roberts

    University of Warwick, United Kingdom

    9 publications · 2.8K citations

    9

    h-index

  3. UK
    U Kang

    Seoul National University, South Korea

    8 publications · 424 citations

    8

    h-index

  4. AD
    Atish Das Sarma

    Georgia Institute of Technology, United States

    7 publications · 260 citations

    7

    h-index

  5. MK
    Maciej Kurant

    École Polytechnique Fédérale de Lausanne, Switzerland

    7 publications · 1.3K citations

    7

    h-index

1–5 of 2.1K

Venues

  1. arXiv (Cornell University)

    Repository · 25 publications · 783 citations

    16

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 12 publications · 735 citations

    12

    h-index

  3. Physical Review E

    PRE · 12 publications · 658 citations

    11

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 10 publications · 1.8K citations

    10

    h-index

  5. Scientific Reports

    9 publications · 360 citations

    9

    h-index

1–5