{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T13:18:51Z","timestamp":1779110331262,"version":"3.51.4"},"reference-count":37,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T00:00:00Z","timestamp":1629936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Identifying influential nodes in complex networks is of great significance for clearly understanding network structure and maintaining network stability. Researchers have proposed many classical methods to evaluate the propagation impact of nodes, but there is still some room for improvement in the identification accuracy. Degree centrality is widely used because of its simplicity and convenience, but it has certain limitations. We divide the nodes into neighbor layers according to the distance between the surrounding nodes and the measured node. Considering that the node\u2019s neighbor layer information directly affects the identification result, we propose a new node influence identification method by combining degree centrality information about itself and neighbor layer nodes. This method first superimposes the degree centrality of the node itself with neighbor layer nodes to quantify the effect of neighbor nodes, and then takes the nearest neighborhood several times to characterize node influence. In order to evaluate the efficiency of the proposed method, the susceptible\u2013infected\u2013recovered (SIR) model was used to simulate the propagation process of nodes on multiple real networks. These networks are unweighted and undirected networks, and the adjacency matrix of these networks is symmetric. Comparing the calculation results of each method with the results obtained by SIR model, the experimental results show that the proposed method is more effective in determining the node influence than seven other identification methods.<\/jats:p>","DOI":"10.3390\/sym13091570","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T22:58:15Z","timestamp":1630450695000},"page":"1570","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Identifying Influential Nodes in Complex Networks Based on Node Itself and Neighbor Layer Information"],"prefix":"10.3390","volume":"13","author":[{"given":"Jingcheng","family":"Zhu","sequence":"first","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lunwen","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,8,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/s11424-020-9252-3","article-title":"Formalising and detecting community structures in real world complex networks","volume":"34","author":"Pawan","year":"2021","journal-title":"J. Syst. Sci. Complex."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1093\/cz\/zoaa052","article-title":"The problem and promise of scale in multilayer animal social networks","volume":"67","author":"Robitaille","year":"2021","journal-title":"Curr. Zool."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"102075","DOI":"10.1016\/j.jairtraman.2021.102075","article-title":"Characterization of delay propagation in the air traffic network","volume":"94","author":"Li","year":"2021","journal-title":"J. Air Transp. Manag."},{"key":"ref_4","unstructured":"Liu, Q., Chen, Y., Zhang, G.Q., and Wang, G.Y. (2021). A novel functional network based on three-way decision for link prediction in signed social networks. Cognit. Comput., 1\u201313."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1093\/bioinformatics\/btaa921","article-title":"GraphDTA: Predicting drug\u2013target binding affinity with graph neural networks","volume":"37","author":"Nguyen","year":"2021","journal-title":"Bioinformatics"},{"key":"ref_6","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_7","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_8","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/BF02289527","article-title":"The centrality index of a graph","volume":"31","author":"Sabidussi","year":"1966","journal-title":"Psychometrika"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","article-title":"Centrality and network flow","volume":"27","author":"Borgatti","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_10","unstructured":"Hwang, W., Cho, Y., Zhang, A., Cho, Y.R., and Hwang, W. (2006, January 20\u201323). Bridging Centrality: Identifying Bridging Nodes in Scale-free Networks. Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201906), Philadelphia, PA, USA."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"L\u00fc, L.Y., Zhang, Y.C., Yeung, C.H., and Zhou, T. (2011). Leaders in social networks, the Delicious case. PLoS ONE, 6.","DOI":"10.1371\/journal.pone.0021202"},{"key":"ref_12","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_13","first-page":"440","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_14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.physa.2013.10.047","article-title":"Identifying and ranking influential spreaders in complex networks by neighborhood coreness","volume":"395","author":"Bae","year":"2014","journal-title":"Phys. A"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.chaos.2018.06.022","article-title":"Density centrality: Identifying influential nodes based on area density formula","volume":"114","author":"Ahmed","year":"2018","journal-title":"Chaos Solitons Fractals"},{"key":"ref_16","first-page":"355","article-title":"Identifying influential spreaders by gravity model","volume":"9","author":"Li","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1850118","DOI":"10.1142\/S0217979218501187","article-title":"Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient","volume":"32","author":"Li","year":"2018","journal-title":"Int. J. Mod. Phys. B"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"123262","DOI":"10.1016\/j.physa.2019.123262","article-title":"Identifying influential nodes in complex networks based on global and local structure","volume":"541","author":"Sheng","year":"2020","journal-title":"Phys. A"},{"key":"ref_19","first-page":"664","article-title":"Influential nodes identification in complex networks based on global and local information","volume":"29","author":"Yang","year":"2020","journal-title":"Chin. Phys. B"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"105580","DOI":"10.1016\/j.knosys.2020.105580","article-title":"Finding influential nodes in social networks based on neighborhood correlation coefficient","volume":"194","author":"Zareie","year":"2020","journal-title":"Knowl. Based Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1088\/1674-1056\/ab77fe","article-title":"Identifying influential spreaders in complex networks based on entropy weight method and gravity law","volume":"29","author":"Yan","year":"2020","journal-title":"Chin. Phys. B."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.cegh.2020.06.006","article-title":"Forecasting COVID-19 epidemic in India and high incidence states using SIR and logistic growth models","volume":"9","author":"Babu","year":"2021","journal-title":"Clin. Epidemiol. Glob. Health"},{"key":"ref_23","first-page":"700","article-title":"A contribution to the mathematical theory of epidemics","volume":"115","author":"Kermack","year":"1927","journal-title":"Proc. R. Soc. A"},{"key":"ref_24","unstructured":"(2021, July 05). Contiguous USA Network Dataset\u2014KONECT. Available online: http:\/\/konect.cc\/networks\/contiguous-usa."},{"key":"ref_25","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","volume":"54","author":"Lusseau","year":"2003","journal-title":"Behav. Ecol. Sociobiol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"2794","DOI":"10.1016\/j.physa.2011.12.055","article-title":"Self-similar scaling of density in complex real-world networks","volume":"391","author":"Blagus","year":"2012","journal-title":"Phys. A"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman","year":"2006","journal-title":"Phys. Rev. E"},{"key":"ref_28","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_29","first-page":"47","article-title":"Pajek-program for large Network analysis","volume":"21","author":"Batagel","year":"1998","journal-title":"Connections"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","article-title":"What\u2019s in a crowd? Analysis of face-to-face behavioral networks","volume":"271","author":"Isella","year":"2011","journal-title":"J. Theor. Biol."},{"key":"ref_31","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":"Danon","year":"2003","journal-title":"Phys. Rev. E"},{"key":"ref_32","unstructured":"(2021, July 19). Datasets. Available online: https:\/\/github.com\/Ismileo\/Datasets."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","article-title":"Assortative mixing in networks","volume":"89","author":"Newman","year":"2002","journal-title":"Phys. Rev. Lett."},{"key":"ref_34","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_35","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1080\/01621459.1966.10480879","article-title":"A computer method for calculating kendall\u2019s tau with ungrouped data","volume":"61","author":"Knight","year":"1966","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_36","first-page":"179","article-title":"Pearson versus Spearman, Kendall\u2019s Tau Correlation Analysis on Structure-Activity Relationships of Biologic Active Compounds","volume":"5","author":"Lorentz","year":"2006","journal-title":"Leonardo J. Sci."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"26199","DOI":"10.1007\/s11042-021-10883-3","article-title":"An objective method to evaluate exemplar-based inpainted images quality using Jaccard index","volume":"80","author":"Amirkhani","year":"2021","journal-title":"Multimed. Tools. Appl."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1570\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:52:14Z","timestamp":1760165534000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/9\/1570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,26]]},"references-count":37,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["sym13091570"],"URL":"https:\/\/doi.org\/10.3390\/sym13091570","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,26]]}}}