{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:26:21Z","timestamp":1773800781483,"version":"3.50.1"},"reference-count":32,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T00:00:00Z","timestamp":1744243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61661037"],"award-info":[{"award-number":["61661037"]}]},{"name":"National Natural Science Foundation of China","award":["62262043"],"award-info":[{"award-number":["62262043"]}]},{"name":"National Natural Science Foundation of China","award":["72461026"],"award-info":[{"award-number":["72461026"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The research into complex networks has consistently attracted significant attention, with the identification of important nodes within these networks being one of the central challenges in this field of study. Existing methods for identifying key nodes based on effective distance commonly suffer from high time complexity and often overlook the impact of nodes\u2019 multi-attribute characteristics on the identification outcomes. To identify important nodes in complex networks more efficiently and accurately, we propose a novel method that leverages an improved effective distance fusion model to identify important nodes. This method effectively reduces redundant calculations of effective distances by employing an effective-influence node set. Furthermore, it incorporates the multi-attribute characteristics of the nodes, characterizing their propagation capabilities by considering local, global, positional, and clustering information and thereby providing a more comprehensive assessment of node importance within complex networks.<\/jats:p>","DOI":"10.3390\/e27040408","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T10:47:41Z","timestamp":1744282061000},"page":"408","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Identification of Important Nodes Based on Local Effective Distance-Integrated Gravity Model"],"prefix":"10.3390","volume":"27","author":[{"given":"Sheng","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1490-6512","authenticated-orcid":false,"given":"Fuhao","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuyuan","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ka","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongmei","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.knosys.2019.01.012","article-title":"Random walk based method to identify essential proteins by integrating network topology and biological characteristics","volume":"167","author":"Lei","year":"2019","journal-title":"Knowl. Based Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.plrev.2018.09.003","article-title":"Chimera states in neuronal networks: A review","volume":"28","author":"Majhi","year":"2019","journal-title":"Phys. Life Rev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"3536","DOI":"10.1109\/JSYST.2018.2890121","article-title":"A Comprehensive Review on Smart Decision Support Systems for Health Care","volume":"13","author":"Moreira","year":"2019","journal-title":"IEEE Syst. J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1109\/TITS.2019.2955359","article-title":"Risk Assessment of an Electrical Power System Considering the Influence of Traffic Congestion on a Hypothetical Scenario of Electrified Transportation System in New York State","volume":"22","author":"Wang","year":"2021","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"120496","DOI":"10.1016\/j.physa.2019.01.065","article-title":"Cascading risk assessment in power-communication interdependent networks","volume":"540","author":"Wang","year":"2020","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/j.ins.2019.11.029","article-title":"Efficient network seeding under variable node cost and limited budget for social networks R","volume":"514","author":"Figueiredo","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ins.2018.04.078","article-title":"Identifying influential genes in protein\u2013protein interaction networks","volume":"454\u2013455","author":"Sun","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1093\/bib\/bbz011","article-title":"Computational methods for identifying the critical nodes in biological networks","volume":"21","author":"Liu","year":"2020","journal-title":"Brief. Bioinform."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/TCSS.2021.3122807","article-title":"Medical Cyber\u2013Physical Systems: A Solution to Smart Health and the State of the Art","volume":"9","author":"Chen","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"4874","DOI":"10.1109\/JSYST.2022.3227632","article-title":"Critical Nodes Identification for Power Grid Based on Electrical Topology and Power Flow Distribution","volume":"17","author":"Fan","year":"2023","journal-title":"IEEE Syst. J."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"123456","DOI":"10.1016\/j.physa.2019.123456","article-title":"Analysis ofthe impact ofonline social networks addiction on the propagation ofrumors","volume":"542","author":"Hosni","year":"2020","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The Structure and Function of Complex Networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_13","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_14","doi-asserted-by":"crossref","unstructured":"Turchetto, M., Bellingeri, M., Alfieri, R., Nguyen, N.-K.-K., Nguyen, Q., and Cassi, D. (2023). Random Walks-Based Node Centralities to Attack Complex Networks. Mathematics, 11.","DOI":"10.3389\/fphy.2023.1245564"},{"key":"ref_15","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":"ref_16","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":"Shang","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"110456","DOI":"10.1016\/j.chaos.2020.110456","article-title":"A generalized gravity model for influential spreaders identification in complex networks","volume":"143","author":"Li","year":"2021","journal-title":"Chaos Solitons Fractals"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1126\/science.1245200","article-title":"The Hidden Geometry of Complex, Network-Driven Contagion Phenomena","volume":"342","author":"Brockmann","year":"2013","journal-title":"Science"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","article-title":"Triadic closure in two-mode networks: Redefining the global and local clustering coefficients","volume":"35","author":"Opsahl","year":"2013","journal-title":"Soc. Netw."},{"key":"ref_20","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_21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1121\/1.1906679","article-title":"Communication patterns in task-oriented groups","volume":"22","author":"Bavelas","year":"1950","journal-title":"J. Acoust. Soc. Am."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Gleiser, P., and Danon, L. (2003). Community Structure in Jazz. arXiv.","DOI":"10.1142\/S0219525903001067"},{"key":"ref_24","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 AAAI Conference on Artificial Intelligence, Austin, TX, USA.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"065103","DOI":"10.1103\/PhysRevE.68.065103","article-title":"Self-similar community structure in organisations","volume":"68","author":"Guimera","year":"2003","journal-title":"Phys. Rev. E"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Yin, H., Benson, A.R., Leskovec, J., and Gleich, D.F. (2017, January 13\u201317). Local Higher-Order Graph Clustering. Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada.","DOI":"10.1145\/3097983.3098069"},{"key":"ref_27","unstructured":"Glance, L.A.A. (2005, January 21\u201325). The Political Blogosphere and the 2004 U.S. Election: Divided They Blog. Proceedings of the 3rd International Workshop on Link Discovery, Chicago, IL, USA."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1038\/nphys560","article-title":"Reaction-diffusion processes and meta-population models in heterogeneous networks","volume":"3","author":"Colizza","year":"2007","journal-title":"Nat. Phys."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1098\/rspa.1927.0118","article-title":"A Contribution to the Mathematical Theory of Epidemics","volume":"115","author":"Kermack","year":"1927","journal-title":"Proc. R. Soc. Lond. A"},{"key":"ref_30","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"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Rak, R., and Rak, E. (2020). The Fractional Preferential Attachment Scale-Free Network Model. Entropy, 22.","DOI":"10.3390\/e22050509"},{"key":"ref_32","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/4\/408\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:12:20Z","timestamp":1760029940000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/4\/408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,10]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["e27040408"],"URL":"https:\/\/doi.org\/10.3390\/e27040408","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,10]]}}}