Random Node Removal

Random Node Removal is a network robustness evaluation method that distinguishes itself by systematically assessing the resilience of a network through the probabilistic deletion of nodes independent of their structural properties, thereby contrasting with targeted removal strategies that prioritize nodes based on specific centrality measures.

39

Publications

5.5K

Citations

118

Authors

66

Institutions

Publications per year

2017–2026

11

Authors

118

  1. SH
    Shlomo Havlin

    Bar-Ilan University, Israel

    4 publications · 2.5K citations

    4

    h-index

  2. HE
    H. Eugene Stanley

    Boston University, United States

    4 publications · 167 citations

    4

    h-index

  3. GC
    Guanrong Chen

    City University of Hong Kong, Hong Kong SAR China

    3 publications · 1.2K citations

    3

    h-index

  4. RC
    Reuven Cohen

    Bar-Ilan University, Israel

    3 publications · 2.5K citations

    3

    h-index

  5. GP
    Gerald Paul

    Boston University, United States

    3 publications · 140 citations

    3

    h-index

1–5 of 118

Venues

  1. Physical Review E

    PRE · 7 publications · 498 citations

    7

    h-index

  2. Scientific Reports

    2 publications · 82 citations

    2

    h-index

  3. Procedia Computer Science

    1 publications · 22 citations

    1

    h-index

  4. PLoS ONE

    1 publications · 39 citations

    1

    h-index

  5. IEEE Communications Letters

    1 publications · 41 citations

    1

    h-index

1–5