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
Parents
39
Resilience of the Internet to Random Breakdowns
Reuven Cohen, Keren Erez, Daniel ben‐Avraham et al. · Physical Review Letters · 2000 · 2.4K citations · Full text
Network robustness of multiplex networks with interlayer degree correlations
Byungjoon Min, Su Yi, Kyu-Min Lee et al. · Physical Review E · 2014 · 269 citations · Full text
1–5 of 39
118
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 118
66
Boston University
Boston, United States
4 h-index
13 publications
542 citations

Bar-Ilan University
Ramat Gan, Israel
4 h-index
7 publications
7.3K citations

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
4 publications
1.2K citations

Shanghai Jiao Tong University
Shanghai, China
3 h-index
3 publications
1.2K citations

University of Palermo
Palermo, Italy
2 h-index
3 publications
51 citations
National Institute of Technology, Kochi College
Kochi, Japan
2 h-index
2 publications
56 citations
Rensselaer Polytechnic Institute
Troy, United States
2 h-index
8 publications
272 citations

University of Maribor
Maribor, Slovenia
2 h-index
2 publications
420 citations
1–8 of 66
PRE · 7 publications · 498 citations
7
h-index
2 publications · 82 citations
2
h-index
1 publications · 22 citations
1
h-index
1 publications · 39 citations
1
h-index
1 publications · 41 citations
1
h-index
1–5