{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:24:14Z","timestamp":1760149454401,"version":"build-2065373602"},"reference-count":54,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T00:00:00Z","timestamp":1690329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"China-Israel Changzhou Innovation Park"},{"name":"Israeli Council for Higher Education (CHE)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Developing a tailor-made centrality measure for a given task requires domain- and network-analysis expertise, as well as time and effort. Thus, automatically learning arbitrary centrality measures for providing ground-truth node scores is an important research direction. We propose a generic deep-learning architecture for centrality learning which relies on two insights: 1. Arbitrary centrality measures can be computed using Routing Betweenness Centrality (RBC); 2. As suggested by spectral graph theory, the sound emitted by nodes within the resonating chamber formed by a graph represents both the structure of the graph and the location of the nodes. Based on these insights and our new differentiable implementation of Routing Betweenness Centrality (RBC), we learn routing policies that approximate arbitrary centrality measures on various network topologies. Results show that the proposed architecture can learn multiple types of centrality indices more accurately than the state of the art.<\/jats:p>","DOI":"10.3390\/e25081115","type":"journal-article","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T01:27:46Z","timestamp":1690421266000},"page":"1115","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Centrality Learning: Auralization and Route Fitting"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3542-3703","authenticated-orcid":false,"given":"Xin","family":"Li","sequence":"first","affiliation":[{"name":"Department of Mechatronics Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liav","family":"Bachar","sequence":"additional","affiliation":[{"name":"Department of Software and Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7229-3899","authenticated-orcid":false,"given":"Rami","family":"Puzis","sequence":"additional","affiliation":[{"name":"Department of Software and Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1142\/S021800140900748X","article-title":"Graph classification based on vector space embedding","volume":"23","author":"Riesen","year":"2009","journal-title":"Int. J. Pattern Recognit. Artif. Intell."},{"key":"ref_2","unstructured":"Sun, F.Y., Qu, M., Hoffmann, J., Huang, C.W., and Tang, J. (2019). Vgraph: A generative model for joint community detection and node representation learning. Adv. Neural Inf. Process. Syst., 32, Available online: https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/48aedb8880cab8c45637abc7493ecddd-Abstract.html."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1109\/TCSS.2019.2950589","article-title":"Topo2vec: A novel node embedding generation based on network topology for link prediction","volume":"6","author":"Mallick","year":"2019","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Ma, X., Qin, G., Qiu, Z., Zheng, M., and Wang, Z. (2019, January 8\u201311). RiWalk: Fast structural node embedding via role identification. Proceedings of the 2019 IEEE International Conference on Data Mining (ICDM), Beijing, China.","DOI":"10.1109\/ICDM.2019.00058"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Macau, E.E.N. (2019). A Mathematical Modeling Approach from Nonlinear Dynamics to Complex Systems, Springer International Publishing.","DOI":"10.1007\/978-3-319-78512-7"},{"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","unstructured":"Tubi, M., Puzis, R., and Elovici, Y. (2007, January 23\u201324). Deployment of DNIDS in social networks. Proceedings of the 2007 IEEE ISI, New Brunswick, NJ, USA.","DOI":"10.1109\/ISI.2007.379534"},{"key":"ref_8","first-page":"60","article-title":"Collaborative attack on Internet users\u2019 anonymity","volume":"19","author":"Puzis","year":"2009","journal-title":"Int. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/TSMC.2016.2531690","article-title":"Using Node Centrality and Optimal Control to Maximize Information Diffusion in Social Networks","volume":"47","author":"Kandhway","year":"2017","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.ins.2011.12.027","article-title":"Laplacian centrality: A new centrality measure for weighted networks","volume":"194","author":"Qi","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Menezes, R., Evsukoff, A., and Gonz\u00e1lez, M.C. (2013). Complex Networks, Springer.","DOI":"10.1007\/978-3-642-30287-9"},{"key":"ref_12","first-page":"102","article-title":"Machine Learning in Network Centrality Measures: Tutorial and Outlook","volume":"51","author":"Grando","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"ref_13","first-page":"220","article-title":"Approximating Network Centrality Measures Using Node Embedding and Machine Learning","volume":"8","author":"Barreto","year":"2020","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"65462","DOI":"10.1109\/ACCESS.2020.2984286","article-title":"A Machine Learning Based Framework for Identifying Influential Nodes in Complex Networks","volume":"8","author":"Zhao","year":"2020","journal-title":"IEEE Access"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3446217","article-title":"Graph Neural Networks for Fast Node Ranking Approximation","volume":"15","author":"Maurya","year":"2021","journal-title":"TKDD"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A tutorial on spectral clustering","volume":"17","year":"2007","journal-title":"Stat. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.automatica.2011.09.019","article-title":"Hearing the clusters of a graph: A distributed algorithm","volume":"48","author":"Sahai","year":"2012","journal-title":"Automatica"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Avrachenkov, K., Jacquet, P., and Sreedharan, J.K. (2016, January 10\u201314). Distributed spectral decomposition in networks by complex diffusion and quantum random walk. Proceedings of the IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications, San Francisco, CA, USA.","DOI":"10.1109\/INFOCOM.2016.7524376"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A., and M\u00fcller, E. (2018, January 19\u201323). Netlsd: Hearing the shape of a graph. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, London, UK.","DOI":"10.1145\/3219819.3219991"},{"key":"ref_20","first-page":"649","article-title":"Can one hear the position of nodes?","volume":"Volume 2","author":"Puzis","year":"2023","journal-title":"Proceedings of the Complex Networks and Their Applications XI: Eleventh International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022"},{"key":"ref_21","unstructured":"Bachar, L., Elyashar, A., and Puzis, R. (2021). International Conference on Complex Networks and Their Applications, Springer."},{"key":"ref_22","unstructured":"Dai, H., Dai, B., and Song, L. (2016, January 20\u201322). Discriminative embeddings of latent variable models for structured data. Proceedings of the International Conference on Machine Learning, PMLR, New York, NY, USA."},{"key":"ref_23","unstructured":"Kipf, T.N., and Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv."},{"key":"ref_24","unstructured":"Kermack, W.O., and McKendrick, A.G. (2019). A contribution to the mathematical theory of epidemics. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Fan, C., Zeng, L., Ding, Y., Chen, M., Sun, Y., and Liu, Z. (2019, January 3\u20137). Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach. Proceedings of the CIKM 2019, Beijing, China.","DOI":"10.1145\/3357384.3357979"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Dolev, S., Elovici, Y., and Puzis, R. (2010, January 3\u20137). Routing Betweenness Centrality. Proceedings of the IEEE Routing Betweenness Centrality, Beijing, China.","DOI":"10.1145\/1734213.1734219"},{"key":"ref_27","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_28","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","article-title":"Centrality in valued graphs: A measure of betweenness based on network flow","volume":"13","author":"Freeman","year":"1991","journal-title":"Soc. Netw."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"016132","DOI":"10.1103\/PhysRevE.64.016132","article-title":"Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality","volume":"64","author":"Newman","year":"2001","journal-title":"Phys. Rev. E"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","article-title":"A faster algorithm for betweenness centrality","volume":"25","author":"Brandes","year":"2001","journal-title":"J. Math. Sociol."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Bahar, P., Bieschke, T., and Ney, H. (2019, January 14\u201318). A comparative study on end-to-end speech to text translation. Proceedings of the 2019 IEEE Automatic Speech Recognition and Understanding Workshop (ASRU), Singapore.","DOI":"10.1109\/ASRU46091.2019.9003774"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"52","DOI":"10.38094\/jastt20291","article-title":"Multimodal emotion recognition using deep learning","volume":"2","author":"Abdullah","year":"2021","journal-title":"J. Appl. Sci. Technol. Trends"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Dai, W., Dai, C., Qu, S., Li, J., and Das, S. (2017, January 5\u20139). Very deep convolutional neural networks for raw waveforms. Proceedings of the 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, New Orleans, LA, USA.","DOI":"10.1109\/ICASSP.2017.7952190"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1734213.1734219","article-title":"Routing betweenness centrality","volume":"57","author":"Dolev","year":"2010","journal-title":"J. ACM"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Penrose, M. (2003). Random Geometric Graphs, OUP Oxford.","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0012-365X(89)90142-8","article-title":"Geometrical embeddings of graphs","volume":"74","author":"Reiterman","year":"1989","journal-title":"Discret. Math."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1198\/016214502388618906","article-title":"Latent space approaches to social network analysis","volume":"97","author":"Hoff","year":"2002","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_38","unstructured":"Xu, P., He, B., De Sa, C., Mitliagkas, I., and Re, C. (2018, January 9\u201311). Accelerated stochastic power iteration. Proceedings of the International Conference on Artificial Intelligence and Statistics, PMLR, Playa Blanca, Lanzarote, Spain."},{"key":"ref_39","unstructured":"Springer Verlag GmbH, European Mathematical Society (2023, May 08). Stochastic Matrix. Available online: http:\/\/encyclopediaofmath.org\/index.php?title=Stochastic_matrix&oldid=35214."},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Golub, G.H., and Van Loan, C.F. (2013). Matrix Computations, JHU Press.","DOI":"10.56021\/9781421407944"},{"key":"ref_41","unstructured":"Koopmans, L.H. (1995). The Spectral Analysis of Time Series, Elsevier."},{"key":"ref_42","unstructured":"MathWorks (2023, May 24). Convert Classification Network into Regression Network. Available online: https:\/\/www.mathworks.com\/help\/deeplearning\/ug\/convert-classification-network-into-regression-network.html."},{"key":"ref_43","unstructured":"Blondel, M., Teboul, O., Berthet, Q., and Djolonga, J. (2020, January 13\u201318). Fast differentiable sorting and ranking. Proceedings of the International Conference on Machine Learning, PMLR, Virtual."},{"key":"ref_44","unstructured":"Haveliwala, T., Kamvar, S., Klein, D., Manning, C., and Golub, G. (2003). Computing PageRank Using Power Extrapolation, Stanford University. Technical Report."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02241709","article-title":"Practical improvement of the divide-and-conquer eigenvalue algorithms","volume":"48","author":"Bini","year":"1992","journal-title":"Computing"},{"key":"ref_46","unstructured":"Kranakis, E., Singh, H., and Urrutia, J. (1999, January 15\u201318). Compass routing on geometric networks. Proceedings of the CCCG 1999, Vancouver, BC, Canada."},{"key":"ref_47","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Albert","year":"1999","journal-title":"Science"},{"key":"ref_49","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_50","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_51","unstructured":"Davis, A., Gardner, B.B., and Gardner, M.R. (2009). Deep South: A Social Anthropological Study of Caste and Class, University of South Carolina Press."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(86)90006-7","article-title":"Cumulated social roles: The duality of persons and their algebras","volume":"8","author":"Breiger","year":"1986","journal-title":"Soc. Netw."},{"key":"ref_53","unstructured":"Knuth, D.E. (1993). The Stanford GraphBase: A Platform for Combinatorial Computing, ACM."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"7581","DOI":"10.1109\/TPAMI.2021.3115452","article-title":"Higher-order explanations of graph neural networks via relevant walks","volume":"44","author":"Schnake","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/8\/1115\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:19:16Z","timestamp":1760127556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/8\/1115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,26]]},"references-count":54,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,8]]}},"alternative-id":["e25081115"],"URL":"https:\/\/doi.org\/10.3390\/e25081115","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,7,26]]}}}