{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T05:18:34Z","timestamp":1779254314142,"version":"3.51.4"},"reference-count":44,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T00:00:00Z","timestamp":1644796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science Foundation of Yunnan Province","award":["No. 202001BB050063"],"award-info":[{"award-number":["No. 202001BB050063"]}]},{"name":"Open Foundation of Key Laboratory in Software Engineering of Yunnan Province","award":["No. 2020SE315"],"award-info":[{"award-number":["No. 2020SE315"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In recent years, the identification of the essential nodes in complex networks has attracted significant attention because of their theoretical and practical significance in many applications, such as preventing and controlling epidemic diseases and discovering essential proteins. Several importance measures have been proposed from diverse perspectives to identify crucial nodes more accurately. In this paper, we propose a novel importance metric called node propagation entropy, which uses a combination of the clustering coefficients of nodes and the influence of the first- and second-order neighbor numbers on node importance to identify essential nodes from an entropy perspective while considering the local and global information of the network. Furthermore, the susceptible\u2013infected\u2013removed and susceptible\u2013infected\u2013removed\u2013susceptible epidemic models along with the Kendall coefficient are used to reveal the relevant correlations among the various importance measures. The results of experiments conducted on several real networks from different domains show that the proposed metric is more accurate and stable in identifying significant nodes than many existing techniques, including degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, and H-index.<\/jats:p>","DOI":"10.3390\/e24020275","type":"journal-article","created":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T20:26:42Z","timestamp":1644870402000},"page":"275","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy"],"prefix":"10.3390","volume":"24","author":[{"given":"Yong","family":"Yu","sequence":"first","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"},{"name":"Key Laboratory in Software Engineering of Yunnan Province, Yunnan University, Kunming 650091, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6538-5170","authenticated-orcid":false,"given":"Biao","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linjie","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Education, Yunnan University of Business Management, Kunming 650033, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinzhuo","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Software, Yunnan University, Kunming 650091, China"},{"name":"Key Laboratory in Software Engineering of Yunnan Province, Yunnan University, Kunming 650091, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2688","DOI":"10.1016\/j.physa.2013.01.023","article-title":"The power grid as a complex network: A survey","volume":"392","author":"Pagani","year":"2013","journal-title":"Phys. A Stat. Mech."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Serrat, O. (2017). Social network analysis. Knowledge Solutions, Springer.","DOI":"10.1007\/978-981-10-0983-9"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s13278-010-0012-6","article-title":"Social network analysis: Developments, advances, and prospects","volume":"1","author":"Scott","year":"2011","journal-title":"Soc. Netw. Anal. Min."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Sathyapriya, R., Vijayabaskar, M., and Vishveshwara, S.J. (2008). Insights into protein\u2013DNA interactions through structure network analysis. PLoS Comput. Biol., 4.","DOI":"10.1371\/journal.pcbi.1000170"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1038\/s41467-020-15353-2","article-title":"A simple contagion process describes spreading of traffic jams in urban networks","volume":"11","author":"Saberi","year":"2020","journal-title":"Nat. Commun."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1038\/nrg.2016.134","article-title":"A network-biology perspective of microRNA function and dysfunction in cancer","volume":"17","author":"Bracken","year":"2016","journal-title":"Nat. Rev. Genet."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.epidem.2015.02.008","article-title":"Controlling infectious disease through the targeted manipulation of contact network structure","volume":"12","author":"Gates","year":"2015","journal-title":"Epidemics"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"20180264","DOI":"10.1098\/rstb.2018.0264","article-title":"Analysing livestock network data for infectious disease control: An argument for routine data collection in emerging economies","volume":"374","author":"Chaters","year":"2019","journal-title":"Philos. Trans. R. Soc. B"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"9220","DOI":"10.1109\/TVT.2019.2930667","article-title":"Incentive mechanisms for crowdblocking rumors in mobile social networks","volume":"68","author":"Lin","year":"2019","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ins.2019.07.055","article-title":"Containment of rumor spread in complex social networks","volume":"506","author":"Yang","year":"2020","journal-title":"J. Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.indmarman.2016.03.014","article-title":"Relationship marketing in Guanxi networks: A social network analysis study of Chinese construction small and medium-sized enterprises","volume":"60","author":"Badi","year":"2017","journal-title":"Ind. Mark. Manag."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"4242","DOI":"10.1021\/acs.jproteome.0c00372","article-title":"Techniques and strategies for potential protein target discovery and active pharmaceutical molecule screening in a pandemic","volume":"19","author":"Yu","year":"2020","journal-title":"J. Proteome Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_14","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_15","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_16","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":"ref_17","doi-asserted-by":"crossref","first-page":"109637","DOI":"10.1016\/j.chaos.2020.109637","article-title":"Identifying influential nodes in complex networks from global perspective","volume":"133","author":"Zhao","year":"2020","journal-title":"Chaos Soliton. Fract."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"115778","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":"ref_19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","article-title":"The anatomy of a large-scale hypertextual web search engine","volume":"30","author":"Brin","year":"1998","journal-title":"Comput. Netw. ISDN Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"L\u00fc, L., Zhang, Y.C., Yeung, C.H., and Zhou, T.J. (2011). Leaders in social networks, the delicious case. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0021202"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Zhang, J.X., Chen, D.B., Dong, Q., and Zhao, Z.D. (2016). Identifying a set of influential spreaders in complex networks. Sci. Rep., 6.","DOI":"10.1038\/srep27823"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","article-title":"Authoritative Sources in a Hyperlinked Environment","volume":"46","author":"Kleinberg","year":"1999","journal-title":"J. ACM"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Guo, C., Yang, L., Chen, X., Chen, D., Gao, H., and Ma, J.J. (2020). Influential nodes identification in complex networks via information entropy. Entropy, 22.","DOI":"10.3390\/e22020242"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","article-title":"A mathematical theory of communication","volume":"27","author":"Shannon","year":"1948","journal-title":"Bell Syst. Tech. J."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.chaos.2017.09.010","article-title":"Influential nodes ranking in complex networks: An entropy-based approach","volume":"104","author":"Zareie","year":"2017","journal-title":"Chaos Soliton. Fract."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.chaos.2017.08.010","article-title":"A new method to identify influential nodes based on relative entropy","volume":"104","author":"Fei","year":"2017","journal-title":"Chaos Soliton. Fract."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.physa.2017.08.049","article-title":"Ranking influential nodes in complex networks with structural holes","volume":"490","author":"Hu","year":"2018","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"033036","DOI":"10.1088\/1367-2630\/abe971","article-title":"Identifying vital nodes by Achlioptas process","volume":"23","author":"Qiu","year":"2021","journal-title":"N. J. Phys."},{"key":"ref_29","first-page":"1","article-title":"The H-index of a network node and its relation to degree and coreness","volume":"7","author":"Zhou","year":"2016","journal-title":"Nat. Commun."},{"key":"ref_30","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_31","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.physa.2016.02.009","article-title":"Using mapping entropy to identify node centrality in complex networks","volume":"453","author":"Nie","year":"2016","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1186\/1752-0509-6-15","article-title":"A new essential protein discovery method based on the integration of protein-protein interaction and gene expression data","volume":"6","author":"Li","year":"2012","journal-title":"BMC Syst. Biol."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Turpin, A., and Scholer, F. (2006, January 6\u201311). User performance versus precision measures for simple search tasks. Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, WA, USA.","DOI":"10.1145\/1148170.1148176"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Kunegis, J. (2013, January 13\u201317). KONECT: The Koblenz network collection. Proceedings of the 22nd International Conference on World Wide Web, Rio de Janeiro, Brazil.","DOI":"10.1145\/2487788.2488173"},{"key":"ref_35","first-page":"452","article-title":"An Information Flow Model for Conflict and Fission in Small Groups","volume":"33","author":"Zachary","year":"1977","journal-title":"Anthropol. Res."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Rossi, R., and Ahmed, N. (2015, January 25\u201330). The network data repository with interactive graph analytics and visualization. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.epidem.2014.07.003","article-title":"Eight challenges for network epidemic models","volume":"10","author":"Pellis","year":"2015","journal-title":"Epidemics"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.neucom.2018.04.086","article-title":"Ranking nodes in complex networks based on local structure and improving closeness centrality","volume":"336","author":"Salavati","year":"2019","journal-title":"Neurocomputing"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"218701","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."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Ruhi, N.A., and Hassibi, B. (2015, January 15\u201318). SIRS epidemics on complex networks: Concurrence of exact Markov chain and approximated models. Proceedings of the Conference on Decision and Control, Osaka, Japan.","DOI":"10.1109\/CDC.2015.7402660"},{"key":"ref_41","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":"Biometrika","year":"1938","journal-title":"Biometrika"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"3838","DOI":"10.1073\/pnas.1009440108","article-title":"Mitigation of malicious attacks on networks","volume":"108","author":"Schneider","year":"2011","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1214\/11-AOP697","article-title":"Random networks with sublinear preferential attachment: The giant component","volume":"41","author":"Dereich","year":"2013","journal-title":"Ann. Probab."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/2\/275\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:19:24Z","timestamp":1760134764000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/2\/275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,14]]},"references-count":44,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["e24020275"],"URL":"https:\/\/doi.org\/10.3390\/e24020275","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,14]]}}}