{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:01:51Z","timestamp":1760058111295,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T00:00:00Z","timestamp":1741824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2022YFB2902500","62325203","U22B2033","2024YQTD02"],"award-info":[{"award-number":["2022YFB2902500","62325203","U22B2033","2024YQTD02"]}]},{"name":"National Natural Science Foundation of China","award":["2022YFB2902500","62325203","U22B2033","2024YQTD02"],"award-info":[{"award-number":["2022YFB2902500","62325203","U22B2033","2024YQTD02"]}]},{"name":"Program for Youth Innovative Research Team of BUPT","award":["2022YFB2902500","62325203","U22B2033","2024YQTD02"],"award-info":[{"award-number":["2022YFB2902500","62325203","U22B2033","2024YQTD02"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In recent years, the rise of power network security incidents caused by malicious attacks has drawn considerable attention to identifying influential nodes in power networks. Power networks are a special class of complex networks characterized by a high relative clustering coefficient, which reflects a more intricate connection between nodes. This paper proposes a novel node influence evaluation algorithm based on hub-triggered neighborhood decomposition and asymmetric order-by-order recurrence model. First, the concepts of network directionalization strategy and hub-triggered neighborhood decomposition are introduced to distinguish the functional differences among nodes in the virus-spreading process. Second, this paper proposes the concepts of infected and infecting potential, then constructs a calculation model with asymmetric characteristics based on the order-by-order recurrence method to fully use the information in the connection structure of the adjacent neighborhood. Finally, the influence of the hub node is evaluated by integrating the infected potential and infecting potential of neighbors of multiple orders. We compare our method with the traditional and state-of-the-art algorithms on six power networks regarding Susceptible\u2013Infected\u2013Recovered (SIR) correlation coefficients, imprecision functions, and algorithmic resolution. The experimental results show that the algorithm proposed in this paper is superior in the above aspects.<\/jats:p>","DOI":"10.3390\/e27030298","type":"journal-article","created":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T06:53:00Z","timestamp":1741848780000},"page":"298","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["HA: An Influential Node Identification Algorithm Based on Hub-Triggered Neighborhood Decomposition and Asymmetric Order-by-Order Recurrence Model"],"prefix":"10.3390","volume":"27","author":[{"given":"Min","family":"Zhao","sequence":"first","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4569-3061","authenticated-orcid":false,"given":"Junhan","family":"Ye","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1379-7799","authenticated-orcid":false,"given":"Jiayun","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China"}]},{"given":"Yuzhuo","family":"Dai","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China"}]},{"given":"Tianze","family":"Zhao","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China"}]},{"given":"Gengchen","family":"Zhang","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,13]]},"reference":[{"key":"ref_1","first-page":"35","article-title":"The 2019 Venezuelan blackout and the consequences of cyber uncertainty","volume":"7","author":"Devanny","year":"2020","journal-title":"Rev. Bras. Estud. Def."},{"key":"ref_2","first-page":"3","article-title":"Goodbye cyberwar: Ukraine as reality check","volume":"10","author":"Maschmeyer","year":"2022","journal-title":"CSS Policy Perspect."},{"key":"ref_3","first-page":"183","article-title":"Cyber threats and nuclear security in india","volume":"9","author":"Poornima","year":"2022","journal-title":"J. Asian Secur. Int. Aff."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"key":"ref_5","first-page":"238","article-title":"Centrality in social networks: Conceptual clarification","volume":"1","author":"Freeman","year":"2002","journal-title":"Soc. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Kitsak","year":"2010","journal-title":"Nat. Phys."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.physa.2015.12.162","article-title":"Identifying influential spreaders in complex networks based on gravity formula","volume":"451","author":"Ma","year":"2016","journal-title":"Physical A"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Li, Z., Ren, T., Ma, X., Liu, S., Zhang, Y., and Zhou, T. (2019). Identifying influential spreaders by gravity model. Sci. Rep., 9.","DOI":"10.1038\/s41598-019-44930-9"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Li, Z., and Huang, X. (2021). Identifying influential spreaders in complex networks by an improved gravity model. Sci. Rep., 11.","DOI":"10.1038\/s41598-021-01218-1"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"9879","DOI":"10.1038\/s41598-022-14005-3","article-title":"Identifying influential spreaders by gravity model considering multi-characteristics of nodes","volume":"12","author":"Li","year":"2022","journal-title":"Sci. Rep."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"121130","DOI":"10.1016\/j.physa.2019.121130","article-title":"Quasi-Laplacian centrality: A new vertex centrality measurement based on Quasi-Laplacian energy of networks","volume":"527","author":"Ma","year":"2019","journal-title":"Physical A"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"101657","DOI":"10.1016\/j.jocs.2022.101657","article-title":"Identifying key nodes in interdependent networks based on Supra-Laplacian energy","volume":"61","author":"Lin","year":"2022","journal-title":"J. Comput. Sci."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0378-8733(00)00031-9","article-title":"Eigenvector-centrality\u2014A node-centrality?","volume":"22","author":"Ruhnau","year":"2000","journal-title":"Soc Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5554322","DOI":"10.1155\/2021\/5554322","article-title":"Information entropy based on propagation feature of node for identifying the influential nodes","volume":"1","author":"Zhong","year":"2021","journal-title":"Complexity"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"101591","DOI":"10.1016\/j.jocs.2022.101591","article-title":"A novel potential edge weight method for identifying influential nodes in complex networks based on neighborhood and position","volume":"60","author":"Meng","year":"2022","journal-title":"J. Comput. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hajarathaiah, K., Enduri, M.K., Anamalamudi, S., Subba Reddy, T., and Tokala, S. (2022). Computing influential nodes using the nearest neighborhood trust value and pagerank in complex networks. Entropy, 24.","DOI":"10.3390\/e24050704"},{"key":"ref_19","first-page":"764","article-title":"Node importance evaluation algorithm based on gravity model and relative path number","volume":"39","author":"Li","year":"2022","journal-title":"Comput. Appl. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"127797","DOI":"10.1016\/j.physa.2022.127797","article-title":"CPR-TOPSIS: A novel algorithm for finding influential nodes in complex networks based on communication probability and relative entropy","volume":"603","author":"Dong","year":"2022","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1186\/s13634-023-00979-3","article-title":"Node importance evaluation in multi-platform avionics architecture based on TOPSIS and PageRank","volume":"1","author":"Liu","year":"2023","journal-title":"EURASIP J. Adv. Signal Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/59.780914","article-title":"The IEEE reliability test system-1996. A report prepared by the reliability test system task force of the application of probability methods subcommittee","volume":"14","author":"Grigg","year":"1999","journal-title":"IEEE Trans. Power Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3258","DOI":"10.1109\/TPWRS.2016.2616385","article-title":"Grid structural characteristics as validation criteria for synthetic networks","volume":"32","author":"Birchfield","year":"2016","journal-title":"IEEE Trans. Power Syst."},{"key":"ref_24","unstructured":"Josz, C., Fliscounakis, S., Maeght, J., and Panciatici, P. (2016). AC power flow data in MATPOWER and QCQP format: ITesla, RTE snapshots, and PEGASE. arXiv."},{"key":"ref_25","unstructured":"(2024, September 09). University of Wisconsin-Madison Arpa-E Grid, Optimization Competition, Challenge 1, Available online: https:\/\/gocompetition.energy.gov\/challenges\/22\/datasets."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., and Ahmed, N.K. (2015, January 25\u201330). Networkrepository: A graph data repository with visual interactive analytics. Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin, TX, USA.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: Can geographic isolation explain this unique trait?","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behav. Ecol. Sociobiol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","article-title":"Community structure in jazz","volume":"6","author":"Gleiser","year":"2003","journal-title":"Adv. Complex Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","article-title":"Self-similar community structure in a network of human interactions","volume":"68","author":"Guimera","year":"2003","journal-title":"Phys. Rev. E"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1137\/S0036144500371907","article-title":"The mathematics of infectious diseases","volume":"42","author":"Hethcote","year":"2000","journal-title":"SIAM Rev."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Xi, Y., and Cui, X. (2023). Identifying influential nodes in complex networks based on information entropy and relationship strength. Entropy, 25.","DOI":"10.3390\/e25050754"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"3769","DOI":"10.1016\/j.physa.2008.01.113","article-title":"Unified index to quantifying heterogeneity of complex networks","volume":"387","author":"Hu","year":"2008","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"114487","DOI":"10.1016\/j.chaos.2024.114487","article-title":"Identifying critical nodes in complex networks based on distance Laplacian energy","volume":"180","author":"Yin","year":"2024","journal-title":"Chaos Solit."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.physa.2016.05.048","article-title":"Fast ranking influential nodes in complex networks using a k-shell iteration factor","volume":"461","author":"Wang","year":"2016","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Li, Y., Cai, W., Li, Y., and Du, X. (2019). Key node ranking in complex networks: A novel entropy and mutual information-based approach. Entropy, 22.","DOI":"10.3390\/e22010052"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/3\/298\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:52:59Z","timestamp":1760028779000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/3\/298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,13]]},"references-count":36,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["e27030298"],"URL":"https:\/\/doi.org\/10.3390\/e27030298","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,3,13]]}}}