{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T21:59:12Z","timestamp":1780955952220,"version":"3.54.1"},"reference-count":64,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Reliability Engineering &amp; System Safety"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ress.2026.112828","type":"journal-article","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T15:24:09Z","timestamp":1778081049000},"page":"112828","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P2","title":["A novel community-aware random walk for identifying critical nodes in complex networks"],"prefix":"10.1016","volume":"275","author":[{"given":"Qian","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1892-8192","authenticated-orcid":false,"given":"Rong","family":"Fei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinhong","family":"Hei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ress.2026.112828_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115778","article-title":"Identifying vital nodes from local and global perspectives in complex networks","volume":"186","author":"Ullah","year":"2021","journal-title":"Expert Syst Appl"},{"key":"10.1016\/j.ress.2026.112828_b2","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.66.016128","article-title":"Spread of epidemic disease on networks","volume":"66","author":"Newman","year":"2002","journal-title":"Phys Rev E"},{"key":"10.1016\/j.ress.2026.112828_b3","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.126.118301","article-title":"Covid-19 superspreading suggests mitigation by social network modulation","volume":"126","author":"Nielsen","year":"2021","journal-title":"Phys Rev Lett"},{"issue":"4","key":"10.1016\/j.ress.2026.112828_b4","doi-asserted-by":"crossref","first-page":"3838","DOI":"10.1109\/TNSE.2024.3388994","article-title":"Vital nodes identification via evolutionary algorithm with percolation optimization in complex networks","volume":"11","author":"Liu","year":"2024","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"10.1016\/j.ress.2026.112828_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109766","article-title":"Node importance identification of unweighted urban rail transit network: An adjacency information entropy based approach","volume":"242","author":"Huang","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112828_b6","first-page":"1","article-title":"Genetic, individual, and familial risk correlates of brain network controllability in major depressive disorder","volume":"28","author":"Winter","year":"2023","journal-title":"Mol Psychiatry"},{"key":"10.1016\/j.ress.2026.112828_b7","series-title":"Centrality measures in complex networks: A survey","author":"Saxena","year":"2020"},{"key":"10.1016\/j.ress.2026.112828_b8","series-title":"2011 international conference on computational aspects of social networks","first-page":"237","article-title":"A degree centrality in multi-layered social network","author":"Br\u00f3dka","year":"2011"},{"key":"10.1016\/j.ress.2026.112828_b9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","article-title":"Betweenness centrality in large complex networks","volume":"38","author":"Barth\u00e9lemy","year":"2004","journal-title":"Eur Phys J B"},{"issue":"3","key":"10.1016\/j.ress.2026.112828_b10","article-title":"Critical nodes identification in complex networks: a survey","volume":"5","author":"Chen","year":"2025","journal-title":"Hepatoma Res"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b11","doi-asserted-by":"crossref","first-page":"8665","DOI":"10.1038\/srep08665","article-title":"Understanding the influence of all nodes in a network","volume":"5","author":"Lawyer","year":"2015","journal-title":"Sci Rep"},{"issue":"3","key":"10.1016\/j.ress.2026.112828_b12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","article-title":"Network structure and minimum degree","volume":"5","author":"Seidman","year":"1983","journal-title":"Soc Netw"},{"issue":"4","key":"10.1016\/j.ress.2026.112828_b13","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0378-8733(00)00031-9","article-title":"Eigenvector-centrality \u2014 a node-centrality?","volume":"22","author":"Ruhnau","year":"2000","journal-title":"Soc Netw"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b14","doi-asserted-by":"crossref","first-page":"21380","DOI":"10.1038\/srep21380","article-title":"Locating influential nodes via dynamics-sensitive centrality","volume":"6","author":"Liu","year":"2016","journal-title":"Sci Rep"},{"issue":"3","key":"10.1016\/j.ress.2026.112828_b15","doi-asserted-by":"crossref","DOI":"10.3390\/en15030797","article-title":"Identification of key nodes in a power grid based on modified pagerank algorithm","volume":"15","author":"Zhu","year":"2022","journal-title":"Energies"},{"key":"10.1016\/j.ress.2026.112828_b16","first-page":"1","article-title":"A continuum limit for the pagerank algorithm","volume":"33","author":"Yuan","year":"2021","journal-title":"European J Appl Math"},{"issue":"2","key":"10.1016\/j.ress.2026.112828_b17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s11235-025-01286-y","article-title":"Recalibrating influence propagation for competitive independent cascade","volume":"88","author":"You","year":"2025","journal-title":"Telecommun Syst"},{"issue":"6\u20131","key":"10.1016\/j.ress.2026.112828_b18","article-title":"Three faces of node importance in network epidemiology: Exact results for small graphs","volume":"96","author":"Holme","year":"2017","journal-title":"Phys Rev E"},{"issue":"5520","key":"10.1016\/j.ress.2026.112828_b19","doi-asserted-by":"crossref","first-page":"1316","DOI":"10.1126\/science.1061076","article-title":"How viruses spread among computers and people","volume":"292","author":"Lloyd","year":"2001","journal-title":"Science"},{"key":"10.1016\/j.ress.2026.112828_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2023.129339","article-title":"Gnr: A universal and efficient node ranking model for various tasks based on graph neural networks","volume":"632","author":"Qu","year":"2023","journal-title":"Phys A"},{"key":"10.1016\/j.ress.2026.112828_b21","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","article-title":"Infgcn: Identifying influential nodes in complex networks with graph convolutional networks","volume":"414","author":"Zhao","year":"2020","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ress.2026.112828_b22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.neucom.2022.05.010","article-title":"A new approach for evaluating node importance in complex networks via deep learning methods","volume":"497","author":"Zhang","year":"2022","journal-title":"Neurocomputing"},{"issue":"6","key":"10.1016\/j.ress.2026.112828_b23","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1038\/s42256-020-0177-2","article-title":"Finding key players in complex networks through deep reinforcement learning","volume":"2","author":"Fan","year":"2020","journal-title":"Nat Mach Intell"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b24","doi-asserted-by":"crossref","DOI":"10.1155\/2023\/5917750","article-title":"Node importance estimation with multiview contrastive representation learning","volume":"2023","author":"Liu","year":"2023","journal-title":"Int J Intell Syst"},{"key":"10.1016\/j.ress.2026.112828_b25","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ins.2016.10.014","article-title":"Optimizing network attacks by artificial bee colony","volume":"377","author":"Lozano","year":"2017","journal-title":"Inform Sci"},{"key":"10.1016\/j.ress.2026.112828_b26","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.engappai.2016.06.010","article-title":"A general evolutionary framework for different classes of critical node problems","volume":"55","author":"Aringhieri","year":"2016","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b27","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/s40747-024-01666-y","article-title":"Influence maximization under imbalanced heterogeneous networks via lightweight reinforcement learning with prior knowledge","volume":"11","author":"You","year":"2024","journal-title":"Complex Intell Syst"},{"issue":"8","key":"10.1016\/j.ress.2026.112828_b28","first-page":"2905","article-title":"Optimal disintegration strategy with heterogeneous costs in complex networks","volume":"50","author":"Deng","year":"2020","journal-title":"IEEE Trans Syst Man Cybern: Syst"},{"issue":"4","key":"10.1016\/j.ress.2026.112828_b29","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1007\/s11590-013-0666-x","article-title":"Exact identification of critical nodes in sparse networks via new compact formulations","volume":"8","author":"Veremyev","year":"2014","journal-title":"Optim Lett"},{"issue":"1605","key":"10.1016\/j.ress.2026.112828_b30","article-title":"Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes","volume":"14","author":"Zhang","year":"2023","journal-title":"Nat Commun"},{"issue":"10","key":"10.1016\/j.ress.2026.112828_b31","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1038\/s41567-021-01371-4","article-title":"The physics of higher-order interactions in complex systems","volume":"17","author":"Battiston","year":"2021","journal-title":"Nat Phys"},{"key":"10.1016\/j.ress.2026.112828_b32","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.apm.2019.05.025","article-title":"Variational community partition with novel network structure centrality prior","volume":"75","author":"Bai","year":"2019","journal-title":"Appl Math Model"},{"issue":"9","key":"10.1016\/j.ress.2026.112828_b33","doi-asserted-by":"crossref","DOI":"10.1145\/3765742","article-title":"Relative entropy-based regularized non-negative matrix factorization for attributed graph clustering","volume":"19","author":"Berahmand","year":"2025","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"4","key":"10.1016\/j.ress.2026.112828_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104096","article-title":"A robust rank aggregation framework for collusive disturbance based on community detection","volume":"62","author":"Chen","year":"2025","journal-title":"Inf Process Manage"},{"key":"10.1016\/j.ress.2026.112828_b35","series-title":"A comprehensive survey on spectral clustering with graph structure learning","author":"Berahmand","year":"2025"},{"issue":"6","key":"10.1016\/j.ress.2026.112828_b36","doi-asserted-by":"crossref","first-page":"4967","DOI":"10.1109\/TNSE.2025.3578315","article-title":"Semi-supervised adaptive symmetric nonnegative matrix factorization for multi-view clustering","volume":"12","author":"Mohammadi","year":"2025","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"6","key":"10.1016\/j.ress.2026.112828_b37","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.14778\/3447689.3447714","article-title":"On analyzing graphs with motif-paths","volume":"14","author":"Li","year":"2021","journal-title":"Proc VLDB Endow"},{"key":"10.1016\/j.ress.2026.112828_b38","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.physa.2016.01.066","article-title":"Centrality measures for networks with community structure","volume":"452","author":"Gupta","year":"2016","journal-title":"Phys A"},{"issue":"5980","key":"10.1016\/j.ress.2026.112828_b39","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1126\/science.1184819","article-title":"Community structure in time-dependent, multiscale, and multiplex networks","volume":"328","author":"Mucha","year":"2010","journal-title":"Science"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b40","article-title":"Identifying modular flows on multilayer networks reveals highly overlapping organization in interconnected systems","volume":"5","author":"De Domenico","year":"2015","journal-title":"Phys Rev X"},{"issue":"3","key":"10.1016\/j.ress.2026.112828_b41","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/comnet\/cnu016","article-title":"Multilayer networks","volume":"2","author":"Kivel\u00e4","year":"2014","journal-title":"J Complex Netw"},{"issue":"2","key":"10.1016\/j.ress.2026.112828_b42","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys Rev E"},{"key":"10.1016\/j.ress.2026.112828_b43","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2025.130505","article-title":"Hypernetwork disintegration with integrated metrics-driven evolutionary algorithm","volume":"666","author":"Ma","year":"2025","journal-title":"Phys A"},{"issue":"5","key":"10.1016\/j.ress.2026.112828_b44","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10462-024-10725-2","article-title":"A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood","volume":"57","author":"Xiao","year":"2024","journal-title":"Artif Intell Rev"},{"key":"10.1016\/j.ress.2026.112828_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121067","article-title":"Identifying vital nodes through augmented random walks on higher-order networks","volume":"679","author":"Zeng","year":"2024","journal-title":"Inform Sci"},{"key":"10.1016\/j.ress.2026.112828_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109806","article-title":"Network reliability analysis through survival signature and machine learning techniques","volume":"242","author":"Shi","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112828_b47","doi-asserted-by":"crossref","first-page":"3260","DOI":"10.1007\/s10489-024-05336-x","article-title":"Learning to rank influential nodes in complex networks via convolutional neural networks","volume":"54","author":"Ahmad","year":"2024","journal-title":"Appl Intell"},{"key":"10.1016\/j.ress.2026.112828_b48","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2024.115192","article-title":"Enimnr: Enhanced node influence maximization through node representation in social networks","volume":"186","author":"Wei","year":"2024","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.ress.2026.112828_b49","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"25905","article-title":"Learning network dismantling without handcrafted inputs","volume":"Vol. 40","author":"Tian","year":"2026"},{"key":"10.1016\/j.ress.2026.112828_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109252","article-title":"An adaptive attack model to network controllability","volume":"235","author":"Li","year":"2023","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112828_b51","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112853","article-title":"Neighborhood information-based probabilistic algorithm for network disintegration","volume":"139","author":"Li","year":"2020","journal-title":"Expert Syst Appl"},{"issue":"7346","key":"10.1016\/j.ress.2026.112828_b52","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1038\/nature10011","article-title":"Controllability of complex networks","volume":"473","author":"Liu","year":"2011","journal-title":"Nature"},{"key":"10.1016\/j.ress.2026.112828_b53","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.physa.2017.05.090","article-title":"Key node selection in minimum-cost control of complex networks","volume":"486","author":"Ding","year":"2017","journal-title":"Phys A"},{"key":"10.1016\/j.ress.2026.112828_b54","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2023.109778","article-title":"Quantification analysis of potential risk in railway accidents: A new random walk based approach","volume":"242","author":"Liu","year":"2024","journal-title":"Reliab Eng Syst Saf"},{"key":"10.1016\/j.ress.2026.112828_b55","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.133.107401","article-title":"Dynamical fluctuations of random walks in higher-order networks","volume":"133","author":"Gaetano","year":"2024","journal-title":"Phys Rev Lett"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b56","doi-asserted-by":"crossref","first-page":"11440","DOI":"10.1038\/s41598-025-94193-w","article-title":"Influential nodes identification for complex networks based on multi-feature fusion","volume":"15","author":"Li","year":"2025","journal-title":"Sci Rep"},{"issue":"2","key":"10.1016\/j.ress.2026.112828_b57","first-page":"275","article-title":"Identifying important nodes in complex networks based on node propagation entropy","volume":"24","author":"Zhao","year":"2021","journal-title":"Entropy"},{"key":"10.1016\/j.ress.2026.112828_b58","doi-asserted-by":"crossref","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J Stat Mech Theory Exp"},{"issue":"04","key":"10.1016\/j.ress.2026.112828_b59","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S2196888823300016","article-title":"The computational complexity of hierarchical clustering algorithms for community detection: A review","volume":"10","author":"Bui","year":"2023","journal-title":"Vietnam J Comput Sci"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b60","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s41109-025-00707-w","article-title":"Robustness assessment of urban road networks in densely populated cities","volume":"10","author":"Kozhabek","year":"2025","journal-title":"Appl Netw Sci"},{"key":"10.1016\/j.ress.2026.112828_b61","doi-asserted-by":"crossref","first-page":"5468","DOI":"10.1103\/PhysRevLett.85.5468","article-title":"Network robustness and fragility: Percolation on random graphs","volume":"85","author":"Callaway","year":"2001","journal-title":"Phys Rev Lett"},{"issue":"5","key":"10.1016\/j.ress.2026.112828_b62","doi-asserted-by":"crossref","first-page":"497","DOI":"10.3390\/e23050497","article-title":"Lpa-mni: An improved label propagation algorithm based on modularity and node importance for community detection","volume":"23","author":"Li","year":"2021","journal-title":"Entropy"},{"key":"10.1016\/j.ress.2026.112828_b63","series-title":"Computer and information sciences - ISCIS 2005","first-page":"284","article-title":"Computing communities in large networks using random walks","author":"Pons","year":"2005"},{"issue":"1","key":"10.1016\/j.ress.2026.112828_b64","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/s41109-025-00695-x","article-title":"Community detection on simplicial complexes","volume":"10","author":"Ermolaev","year":"2025","journal-title":"Appl Netw Sci"}],"container-title":["Reliability Engineering &amp; System Safety"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832026006393?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0951832026006393?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T21:17:46Z","timestamp":1780953466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0951832026006393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":64,"alternative-id":["S0951832026006393"],"URL":"https:\/\/doi.org\/10.1016\/j.ress.2026.112828","relation":{},"ISSN":["0951-8320"],"issn-type":[{"value":"0951-8320","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel community-aware random walk for identifying critical nodes in complex networks","name":"articletitle","label":"Article Title"},{"value":"Reliability Engineering & System Safety","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ress.2026.112828","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"112828"}}