{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T13:01:53Z","timestamp":1780750913647,"version":"3.54.1"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"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":["Information Sciences"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ins.2026.123590","type":"journal-article","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T22:56:39Z","timestamp":1778108199000},"page":"123590","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A novel influence rank algorithm in complex networks"],"prefix":"10.1016","volume":"752","author":[{"given":"Xinbang","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5678-4893","authenticated-orcid":false,"given":"Jiafei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chia-Wei","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingli","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0351-8553","authenticated-orcid":false,"given":"Gaoshi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ins.2026.123590_bib0005","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1038\/s42254-023-00676-y","article-title":"Robustness and resilience of complex networks","volume":"6","author":"Artime","year":"2024","journal-title":"Nat. Rev. Phys."},{"issue":"2","key":"10.1016\/j.ins.2026.123590_bib0010","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.109.024314","article-title":"Complex networks with complex weights","volume":"109","author":"B\u00f6ttcher","year":"2024","journal-title":"Phys. Rev. E"},{"issue":"6","key":"10.1016\/j.ins.2026.123590_bib0015","first-page":"2380","article-title":"Synchronization in kuramoto oscillator networks with sampled-data updating law","volume":"50","author":"Shi","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ins.2026.123590_bib0020","first-page":"1","article-title":"Identification and role of opinion leaders in information diffusion for online discussion network","author":"Din","year":"2023","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"issue":"2","key":"10.1016\/j.ins.2026.123590_bib0025","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.3390\/su15021249","article-title":"Hybrid approach for detecting propagandistic community and core node on social networks","volume":"15","author":"Khanday","year":"2023","journal-title":"Sustainability"},{"key":"10.1016\/j.ins.2026.123590_bib0030","article-title":"Controllability evaluation of complex networks in cyber\u2013physical power systems via critical nodes and edges","volume":"155","author":"Ge","year":"2024","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"10.1016\/j.ins.2026.123590_bib0035","article-title":"Node importance evaluation in marine traffic situation complex network for intelligent maritime supervision","volume":"247","author":"Du","year":"2022","journal-title":"Ocean Eng."},{"key":"10.1016\/j.ins.2026.123590_bib0040","article-title":"Complex-network-based traffic network analysis and dynamics: a comprehensive review","volume":"607","author":"Guo","year":"2022","journal-title":"Phys. a Stat. Mech. Appl."},{"issue":"1","key":"10.1016\/j.ins.2026.123590_bib0045","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":"10.1016\/j.ins.2026.123590_bib0050","doi-asserted-by":"crossref","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","volume":"40","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"issue":"3","key":"10.1016\/j.ins.2026.123590_bib0055","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0378-8733(01)00038-7","article-title":"Eigenvector-like measures of centrality for asymmetric relations","volume":"23","author":"Bonacich","year":"2001","journal-title":"Soc. Netw."},{"key":"10.1016\/j.ins.2026.123590_bib0060","series-title":"Social Network: Critical Concepts in Sociology","first-page":"238","article-title":"Centrality in social networks: conceptual clarification","volume":"vol. 1","author":"Freeman","year":"2002"},{"issue":"11","key":"10.1016\/j.ins.2026.123590_bib0065","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1038\/nphys1746","article-title":"Identification of influential spreaders in complex networks","volume":"6","author":"Gallos","year":"2010","journal-title":"Nat. Phys."},{"issue":"1","key":"10.1016\/j.ins.2026.123590_bib0070","doi-asserted-by":"crossref","DOI":"10.1038\/ncomms10168","article-title":"The H-index of a network node and its relation to degree and coreness","volume":"7","author":"L\u00fc","year":"2016","journal-title":"Nat. Commun."},{"issue":"4","key":"10.1016\/j.ins.2026.123590_bib0075","doi-asserted-by":"crossref","first-page":"1777","DOI":"10.1016\/j.physa.2011.09.017","article-title":"Identifying influential nodes in complex networks","volume":"391","author":"Chen","year":"2012","journal-title":"Phys. a Stat. Mech. Appl."},{"key":"10.1016\/j.ins.2026.123590_bib0080","article-title":"Identifying key nodes in interdependent networks based on Supra-Laplacian energy","volume":"61","author":"Chen","year":"2022","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.ins.2026.123590_bib0085","article-title":"Identifying influential nodes based on resistance distance","volume":"67","author":"Chen","year":"2023","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.ins.2026.123590_bib0090","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":"Phys. a Stat. Mech. Appl."},{"key":"10.1016\/j.ins.2026.123590_bib0095","article-title":"GMM: a generalized mechanics model for identifying the importance of nodes in complex networks","volume":"193","author":"Deng","year":"2020","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.ins.2026.123590_bib0100","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ins.2021.01.053","article-title":"Identifying influential nodes in complex networks: effective distance gravity model","volume":"577","author":"Cheong","year":"2021","journal-title":"Inf. Sci."},{"issue":"18","key":"10.1016\/j.ins.2026.123590_bib0105","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1007\/s11227-025-08133-6","article-title":"A novel ranking scheme for identifying influential nodes in complex networks: Q. Yang et al.","volume":"81","author":"Yang","year":"2025","journal-title":"J. Supercomput."},{"key":"10.1016\/j.ins.2026.123590_bib0110","first-page":"2","article-title":"Key nodes mining for complex networks based on local gravity method","volume":"217","author":"Ren","year":"2023","journal-title":"J. Control Decis."},{"key":"10.1016\/j.ins.2026.123590_bib0115","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1016\/j.ins.2022.07.084","article-title":"The random walk-based gravity model to identify influential nodes in complex networks","volume":"609","author":"Cheong","year":"2022","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123590_bib0120","article-title":"Weighted k-shell degree neighborhood: a new method for identifying the influential spreaders from a variety of complex network connectivity structures","volume":"139","author":"Dutta","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123590_bib0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.physleta.2025.131004","article-title":"A multi-feature vital node identification scheme in complex networks","author":"Cheng","year":"2025","journal-title":"Phys. Lett. A"},{"issue":"1","key":"10.1016\/j.ins.2026.123590_bib0130","doi-asserted-by":"crossref","first-page":"8387","DOI":"10.1038\/s41598-019-44930-9","article-title":"Identifying influential spreaders by gravity model","volume":"9","author":"Li","year":"2019","journal-title":"Sci. Rep."},{"key":"10.1016\/j.ins.2026.123590_bib0135","article-title":"An improved gravity model to identify influential nodes in complex networks based on k-shell method","volume":"227","author":"Xiao","year":"2021","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.ins.2026.123590_bib0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2026.118231","article-title":"Critical node identification in complex networks via gravity model based on steady-state restart Markov chain","volume":"208","author":"Li","year":"2026","journal-title":"Chaos Solit. Fractals"},{"key":"10.1016\/j.ins.2026.123590_bib0145","article-title":"Node importance estimation in complex networks based on entropic modularity-perturbed gravity model","author":"Li","year":"2026","journal-title":"Phys. Lett. A"},{"issue":"5","key":"10.1016\/j.ins.2026.123590_bib0150","first-page":"665","article-title":"Information cascades in complex networks","volume":"5","author":"Jalili","year":"2017","journal-title":"J. Complex Netw."},{"issue":"9","key":"10.1016\/j.ins.2026.123590_bib0155","doi-asserted-by":"crossref","first-page":"5766","DOI":"10.1073\/pnas.082090499","article-title":"A simple model of global cascades on random networks","volume":"99","author":"Watts","year":"2002","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.ins.2026.123590_bib0160","series-title":"International Conference on Knowledge-Based and Intelligent Information and Engineering Systems","first-page":"67","article-title":"Prediction of information diffusion probabilities for independent cascade model","author":"Kimura","year":"2008"},{"issue":"3","key":"10.1016\/j.ins.2026.123590_bib0165","doi-asserted-by":"crossref","first-page":"895","DOI":"10.2307\/1428186","article-title":"The quasi-stationary distribution of the closed endemic SIS model","volume":"28","author":"N\u00e5sell","year":"1996","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/j.ins.2026.123590_bib0170","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1140\/epjb\/e20020122","article-title":"Epidemic outbreaks in complex heterogeneous networks","volume":"26","author":"Moreno","year":"2002","journal-title":"Eur. Phys. J. B-Condens. Matter Complex Syst."},{"issue":"1\u20132","key":"10.1016\/j.ins.2026.123590_bib0175","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","article-title":"A new measure of rank correlation","volume":"30","author":"Kendall","year":"1938","journal-title":"Biometrika"},{"issue":"3","key":"10.1016\/j.ins.2026.123590_bib0180","first-page":"677","article-title":"An algorithm for identifying critical nodes in complex networks based on betweenness centrality entropy","volume":"52","author":"Li","year":"2024","journal-title":"Comput. Digit. Eng."},{"key":"10.1016\/j.ins.2026.123590_bib0185","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1016\/j.ins.2021.08.026","article-title":"The identification of crucial spreaders in complex networks by effective gravity model","volume":"578","author":"Li","year":"2021","journal-title":"Inf. Sci."},{"issue":"21","key":"10.1016\/j.ins.2026.123590_bib0190","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.105.218701","article-title":"Thresholds for epidemic spreading in networks","volume":"105","author":"Castellano","year":"2010","journal-title":"Phys. Rev. Lett."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526005219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526005219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T12:45:52Z","timestamp":1780749952000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526005219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":38,"alternative-id":["S0020025526005219"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123590","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A novel influence rank algorithm in complex networks","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123590","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"123590"}}