20 citations · 30 across the 4 of their papers we have counts for
4 papers
Cost-effective Network Disintegration through Targeted Enumeration
Zhigang Wang, Ye Deng, Petter Holme +3
Finding an optimal subset of nodes or links to disintegrate harmful networks is a fundamental problem in network science, with potential applications to anti-terrorism, epidemic co…
Robustness of Random Graphs Based on Natural Connectivity
Jun Wu, Mauricio Barahona, Yuejin Tan +1
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redunda…
Robustness of Regular Graphs Based on Natural Connectivity
Jun Wu, Mauricio Barahona, Yuejin Tan +1
It has been recently proposed that the natural connectivity can be used to characterize efficiently the robustness of complex networks. The natural connectivity quantifies the redu…
Spectral Measure of Robustness in Complex Networks
Jun Wu, Yue-Jin Tan, Hong-Zhong Deng +3
We introduce the concept of natural connectivity as a robustness measure of complex networks. The natural connectivity has a clear physical meaning and a simple mathematical formul…