The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment
Abstract
Power networks and information systems become more and more interdependent to ensure better supports for the functionality as well as improve the economy. However, power networks also tend to be more vulnerable due to the cascading failures from their interdependent information systems, i.e., the failures in the information systems can cause the failures of the coupled portion in power networks. Therefore, the accurate vulnerability assessment of interdependent power networks is of great importance in the presence of unexpected disruptive events or adversarial attacks targeting on critical network nodes. In this paper, we study the Interdependent Power Network Disruptor (IPND) optimization problem to identify critical nodes in an interdependent power network whose removals maximally destroy its functions due to both malfunction of these nodes and the cascading failures of its interdependent communication network. First, we show the IPND problem is NP-hard to be approximated within the factor of (2-ε) . Despite its intractability, we propose a greedy framework with novel centrality functions based on the networks' interdependencies, to efficiently solve this problem in a timely manner. An extensive experiment not only illustrates the effectiveness of our approach on networks with different topologies and interdependencies, but also highlights some important observations which help to sharpen the robustness of interdependent networks in the future.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
The igraph software package for complex network research
Csárdi, G., & Nepusz, T. (2006) · Medical Entomology and Zoology · Cited by 13,511
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Characterization of complex networks: A survey of measurements
Costa, L. D. F., Rodrigues, F. A., Travieso, G., & Villas Boas, P. R. (2007) · Advances in Physics · doi:10.1080/00018730601170527 · Cited by 2,475
Linear algebra and its applications
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90164-x · Cited by 2,001
(2018) · De Gruyter eBooks · doi:10.1515/9783110542400 · Cited by 1,876
A Graph-theoretic perspective on centrality
Borgatti, S. P., & Everett, M. G. (2006) · Social Networks · doi:10.1016/j.socnet.2005.11.005 · Cited by 1,678
Structural vulnerability of the North American power grid
Albert, R., Albert, I., & Nakarado, G. L. (2004) · Physical Review E · doi:10.1103/physreve.69.025103 · Cited by 1,415
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Algorithm 447: efficient algorithms for graph manipulation
Hopcroft, J., & Tarjan, R. (1973) · Communications of the ACM · doi:10.1145/362248.362272 · Cited by 985
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788
(2005) · Lecture Notes in Computer Science · doi:10.1007/b106453 · Cited by 636
Robustness of interdependent networks under targeted attack
Huang, X., Gao, J., Buldyrev, S. V., Havlin, S., & Stanley, H. E. (2011) · Physical Review E · doi:10.1103/physreve.83.065101 · Cited by 527
Modelling interdependent infrastructures using interacting dynamical models
Rosato, V., Issacharoff, L., Tiriticco, F., Meloni, S., Porcellinis, S. D., & Setola, R. (2008) · International Journal of Critical Infrastructures · doi:10.1504/ijcis.2008.016092 · Cited by 490
Detecting critical nodes in sparse graphs
Arulselvan, A., Commander, C. W., Elefteriadou, L., & Pardalos, P. M. (2009) · Computers & Operations Research · doi:10.1016/j.cor.2008.08.016 · Cited by 381
Inter-similarity between coupled networks
Rozenblat, C., Ietri, D., Ducruet, C., & Havlin, S. (2015) · Cited by 331
Inter-similarity between coupled networks
Parshani, R., Rozenblat, C., Ietri, D., Ducruet, C., & Havlin, S. (2010) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/92/68002 · Cited by 309
Interdependent networks with identical degrees of mutually dependent nodes
Buldyrev, S. V., Shere, N. W., & Cwilich, G. A. (2011) · Physical Review E · doi:10.1103/physreve.83.016112 · Cited by 248
Towards designing robust coupled networks
Schneider, C., Yazdani, N. A., Araújo, N. A. M., Havlin, S., & Herrmann, H. J. (2013) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · doi:10.3929/ethz-b-000068244 · Cited by 149
Networks Evolving Step by Step: Statistical Analysis of Dyadic Event Data
Brandes, U., Lerner, J., & Snijders, T. A. B. (2009) · doi:10.1109/asonam.2009.28 · Cited by 142
Bridging Centrality: Identifying Bridging Nodes in Scale-free Networks
Ramanathan, M. K., Zhang, A., Cho, Y., & Hwang, W. (2006) · Cited by 69
Cited by
The Critical Node Detection Problem in networks: A survey
Lalou, M., Tahraoui, M. A., & Kheddouci, H. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.02.002 · Cited by 311
Transportation resilience to climate change and extreme weather events – Beyond risk and robustness
Markolf, S. A., Hoehne, C., Fraser, A., Chester, M. V., & Underwood, B. S. (2019) · Transport Policy · doi:10.1016/j.tranpol.2018.11.003 · Cited by 304
Defining and Enabling Resiliency of Electric Distribution Systems With Multiple Microgrids
Chanda, S., & Srivastava, A. K. (2016) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2561303 · Cited by 286
Metadata
- Authors
- Nguyen, D. T., Shen, Y., & Thai, M. T.
- Venue
- IEEE Transactions on Smart Grid
- Published
- 2013-03
- Volume
- 4
- Issue
- 1
- Pages
- 151-159
- ISSN
- 1949-3053 (ISSN-L)
- 1949-3061
- OpenAlex
- W2159863842
- Cited by
- 279
- References
- 25
- FWCI
- 12.44
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.