{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T11:20:16Z","timestamp":1771068016792,"version":"3.50.1"},"reference-count":31,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T00:00:00Z","timestamp":1663632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper, we present a new method to measure the nodes\u2019 centrality in a multilayer network. The multilayer network represents nodes with different relations between them. The nodes have an initial relevance or importance value. Then, the node\u2019s centrality is obtained according to this relevance along with its relationship to other nodes. Many methods have been proposed to obtain the node\u2019s centrality by analyzing the network as a whole. In this paper, we present a new method to obtain the centrality in which, in the first stage, every layer would be able to define the importance of every node in the multilayer network. In the next stage, we would integrate the importance given by each layer to each node. As a result, the node that is perceived with a high level of importance for all of its layers, and the neighborhood with the highest importance, obtains the highest centrality score. This score has been named the corner centrality. As an example of how the new measure works, suppose we have a multilayer network with different layers, one per research area, and the nodes are authors belonging to an area. The initial importance of the nodes (authors) could be their h-index. A paper published by different authors generates a link between them in the network. The authors can be in the same research area (layer) or different areas (different layers). Suppose we want to obtain the centrality measure of the authors (nodes) in a concrete area (target layer). In the first stage, every layer (area) receives the importance of every node in the target layer. Additionally, in the second stage, the relative importance given for every layer to every node is integrated with the importance of every node in its neighborhood in the target layer. This process can be repeated with every layer in the multilayer network. The method proposed has been tested with different configurations of multilayer networks, with excellent results. Moreover, the proposed algorithm is very efficient regarding computational time and memory requirements.<\/jats:p>","DOI":"10.3390\/a15100336","type":"journal-article","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T21:12:53Z","timestamp":1663708373000},"page":"336","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Corner Centrality of Nodes in Multilayer Networks: A Case Study in the Network Analysis of Keywords"],"prefix":"10.3390","volume":"15","author":[{"given":"Rosa Mar\u00eda","family":"Rodriguez-S\u00e1nchez","sequence":"first","affiliation":[{"name":"Departamento de Ciencias de la Computaci\u00f3n e I.A., CITIC-UGR, Universidad de Granada, 18071 Granada, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6334-3786","authenticated-orcid":false,"given":"Jorge","family":"Chamorro-Padial","sequence":"additional","affiliation":[{"name":"Departamento de Ciencias de la Computaci\u00f3n e I.A., CITIC-UGR, Universidad de Granada, 18071 Granada, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Newman, M. (2010). Networks: An Introduction, Oxford University Press.","DOI":"10.1093\/acprof:oso\/9780199206650.003.0001"},{"key":"ref_2","unstructured":"Applegate, D.L., Bixby, R.M., Chv\u00e1tal, V., and Cook, W.J. (2006). The Traveling Salesman Problem, Princeton University Press."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"32302","DOI":"10.1103\/PhysRevE.93.032302","article-title":"Multiplex networks with heterogeneous activities of the nodes","volume":"93","author":"Cellai","year":"2016","journal-title":"Phys. Rev. E"},{"key":"ref_5","first-page":"041022","article-title":"Mathematical Formulation of Multilayer Networks","volume":"3","author":"Cozzo","year":"2013","journal-title":"Phys. Rev. X"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Bazzi, M., Lucas, G., Jeub, S., Arenas, A., Howison, S.D., and Porter, M.A. (2020). A framework for the construction of generative models for mesoscale structure in multilayer networks. Phys. Rev. Res.","DOI":"10.1103\/PhysRevResearch.2.023100"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"10201","DOI":"10.1088\/1367-2630\/ab4fcb","article-title":"Focus on multilayer networks","volume":"22","author":"Moreno","year":"2019","journal-title":"New J. Phys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.plrev.2017.11.003","article-title":"Network science of biological systems at different scales: A review","volume":"24","author":"Gosak","year":"2018","journal-title":"Phys. Life Rev."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.dcan.2018.10.011","article-title":"Traffic dynamics on multilayer networks","volume":"6","author":"Wu","year":"2020","journal-title":"Digit. Commun. Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"023117","DOI":"10.1063\/5.0081954","article-title":"Evolutionary multigame with conformists and profiteers based on dynamic complex networks","volume":"32","author":"Pi","year":"2022","journal-title":"Chaos Interdiscip. J. Nonlinear Sci."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"S119","DOI":"10.1137\/20M1373335","article-title":"The role of asymptomatic infections in the COVID-19 epidemic via complex networks and stability analysis","volume":"60","author":"Stella","year":"2022","journal-title":"SIAM J. Control Optim."},{"key":"ref_12","first-page":"2186","article-title":"An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector","volume":"219","author":"Agryzkov","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Agryzkov, T., Curado, M., Pedroche, F., Tortosa, L., and Vicent, J.F. (2019). Extending the Adapted PageRank Algorithm Centrality to Multiplex Networks with Data Using the PageRank Two-Layer Approach. Symmetry, 11.","DOI":"10.3390\/sym11020284"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/cgf.13610","article-title":"The State of the Art in Multilayer Network Visualization","volume":"38","author":"McGee","year":"2019","journal-title":"Comput. Graph. Forum"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"664860","DOI":"10.3389\/fgene.2021.664860","article-title":"Application of Multilayer Network Models in Bioinformatics","volume":"12","author":"Lv","year":"2021","journal-title":"Front. Genet."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"596","DOI":"10.3389\/fvets.2020.00596","article-title":"Multilayer and Multiplex Networks: An Introduction to Their Use in Veterinary Epidemiology","volume":"7","author":"Kinsley","year":"2020","journal-title":"Front. Vet. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"33131","DOI":"10.1063\/1.4818544","article-title":"Eigenvector centrality of nodes in multiplex networks","volume":"23","author":"Sola","year":"2013","journal-title":"Chaos"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"28004","DOI":"10.1209\/0295-5075\/116\/28004","article-title":"Functional Multiplex PageRank","volume":"116","author":"Iacovacci","year":"2016","journal-title":"Eur. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"e4754","DOI":"10.1002\/dac.4754","article-title":"A method for routing and data aggregating in cluster-based wireless sensor networks","volume":"34","author":"Sharifi","year":"2021","journal-title":"Int. J. Commun. Syst."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Oliveira, E.M., Ramos, H.S., and Loureiro, A.A. (2010, January 20\u201322). Centrality-based routing for wireless sensor networks. Proceedings of the 3rd IFIP Wireless Days Conference 2010, Venice, Italy.","DOI":"10.1109\/WD.2010.5657731"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Kenyeres, M., and Kenyeres, J. (2021). Comparative Study of Distributed Consensus Gossip Algorithms for Network Size Estimation in Multi-Agent Systems. Future Internet, 13.","DOI":"10.3390\/fi13050134"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Halu, A., Mondragon, R., Panzarasa, P., and Bianconi, G. (2013). Multiplex PageRank. PLoS ONE, 8.","DOI":"10.1371\/journal.pone.0078293"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Sol\u00e9-Ribalta, A., De Domenico, M., G\u00f3mez, S., and Arenas, A. (2014, January 23\u201326). Centrality Rankings in Multiplex Networks. Proceedings of the 2014 ACM Conference on Web Science, Bloomington, IN, USA.","DOI":"10.1145\/2615569.2615687"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bianconi, G. (2018). Multilayer Networks. Structure and Functions, Oxford University Press.","DOI":"10.1093\/oso\/9780198753919.001.0001"},{"key":"ref_25","unstructured":"Harris, C., and Stephens, M. (September, January 31). A Combined Corner and Edge Detector. Proceedings of the 4th Alvey Vision Conference, Manchester, UK."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"6868","DOI":"10.1038\/ncomms7868","article-title":"Ranking in interconnected multilayer networks reveals versatile nodes","volume":"6","author":"Omodei","year":"2015","journal-title":"Nat. Commun."},{"key":"ref_27","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_28","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1086\/230190","article-title":"Robust Action and the Rise of the Medici, 1400\u20131434","volume":"98","author":"Padgett","year":"1993","journal-title":"Am. J. Sociol."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"101066","DOI":"10.1016\/j.joi.2020.101066","article-title":"How do authors select keywords? A preliminary study of author keyword selection behavior","volume":"14","author":"Lu","year":"2020","journal-title":"J. Informetr."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1002\/(SICI)1097-4571(199306)44:5<298::AID-ASI5>3.0.CO;2-A","article-title":"KeyWords Plus. Algorithmic Derivative Indexing","volume":"44","author":"Garfield","year":"1993","journal-title":"J. Am. Soc. Inf. Sci."},{"key":"ref_31","unstructured":"Aho, A.V., Hopcroft, J.E., and Ullman, J.D. (1974). The Design and Analysis of Computer Algorithms, Theorem 6.6, Addison-Wesley."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/336\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:34:57Z","timestamp":1760142897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/10\/336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,20]]},"references-count":31,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["a15100336"],"URL":"https:\/\/doi.org\/10.3390\/a15100336","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,20]]}}}