{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T19:18:56Z","timestamp":1787253536179,"version":"3.56.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Szeged Open Access Fund","award":["4536"],"award-info":[{"award-number":["4536"]}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"crossref","award":["EFOP-3.6.3-VEKOP-16-2017-00002"],"award-info":[{"award-number":["EFOP-3.6.3-VEKOP-16-2017-00002"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ministry of Innovation and Technology, Hungary","award":["TUDFO\/47138-1\/2019-ITM"],"award-info":[{"award-number":["TUDFO\/47138-1\/2019-ITM"]}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["EFOP-3.6.2-16-2017-00015"],"award-info":[{"award-number":["EFOP-3.6.2-16-2017-00015"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Identifying key actors or nodes in a network is a relevant task regarding many applications. In general, the real-valued function that evaluates the nodes is called node centrality measure. Performing a relevance-based ranking on the list of nodes is also of high practical importance, since the most central nodes by a measure usually provide the highest contribution in explaining the behavior of the whole network. Stability of centrality measures against graph perturbation is an important concept, especially in the analysis of real world\u2014often noise contaminated\u2014datasets from different domains. In this paper, with the utilization of the formal definition of stability introduced by Segarra and Ribeiro (IEEE Trans Signal Process 64(3):543\u2013555, 2015), we discuss three main perturbation categories and experimentally analyze the stability of several node centrality measures.<\/jats:p>","DOI":"10.1007\/s13278-020-00693-0","type":"journal-article","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T20:24:56Z","timestamp":1600287896000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Stability of network centrality measures: a numerical study"],"prefix":"10.1007","volume":"10","author":[{"given":"Orsolya","family":"Kardos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e1s","family":"London","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3724-4725","authenticated-orcid":false,"given":"Tam\u00e1s","family":"Vink\u00f3","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,16]]},"reference":[{"issue":"1","key":"693_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74(1):47\u201397","journal-title":"Rev Mod Phys"},{"issue":"2","key":"693_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/bs.3830100205","volume":"10","author":"MA Beauchamp","year":"1965","unstructured":"Beauchamp MA (1965) An improved index of centrality. Behav Sci 10(2):161\u2013163","journal-title":"Behav Sci"},{"issue":"4","key":"693_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s13278-013-0096-x","volume":"3","author":"P Boldi","year":"2013","unstructured":"Boldi P, Rosa M, Vigna S (2013) Robustness of social and web graphs to node removal. Soc Netw Anal Min 3(4):829\u2013842","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"693_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2(1):113\u2013120","journal-title":"J Math Sociol"},{"issue":"2","key":"693_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.socnet.2005.05.001","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP, Carley KM, Krackhardt D (2006) On the robustness of centrality measures under conditions of imperfect data. Soc Netw 28(2):124\u2013136","journal-title":"Soc Netw"},{"issue":"1\u20137","key":"693_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"issue":"3","key":"693_CR7","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/rsa.10084","volume":"22","author":"C Cooper","year":"2003","unstructured":"Cooper C, Frieze A (2003) A general model of web graphs. Random Struct Algorithms 22(3):311\u2013335","journal-title":"Random Struct Algorithms"},{"issue":"4","key":"693_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0378-8733(03)00012-1","volume":"25","author":"E Costenbader","year":"2003","unstructured":"Costenbader E, Valente TW (2003) The stability of centrality measures when networks are sampled. Soc Netw 25(4):283\u2013307","journal-title":"Soc Netw"},{"issue":"1","key":"693_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s13278-018-0493-2","volume":"8","author":"K Das","year":"2018","unstructured":"Das K, Samanta S, Pal M (2018) Study on centrality measures in social networks: a survey. Soc Netw Anal Min 8(1):13\u201323","journal-title":"Soc Netw Anal Min"},{"issue":"5","key":"693_CR10","doi-asserted-by":"publisher","first-page":"e0217141","DOI":"10.1371\/journal.pone.0217141","volume":"14","author":"D Delpini","year":"2019","unstructured":"Delpini D, Battiston S, Caldarelli G, Riccaboni M (2019) Systemic risk from investment similarities. PLoS ONE 14(5):e0217141","journal-title":"PLoS ONE"},{"key":"693_CR11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P, R\u00e9nyi A (1959) On random graphs. Publ Math Debr 6:290\u2013297","journal-title":"Publ Math Debr"},{"issue":"1","key":"693_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40(1):35\u201341","journal-title":"Sociometry"},{"issue":"3","key":"693_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Soc Netw 1(3):215\u2013239","journal-title":"Soc Netw"},{"issue":"1","key":"693_CR14","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s13278-014-0238-9","volume":"4","author":"G Ghoshal","year":"2014","unstructured":"Ghoshal G, Mangioni G, Menezes R, Poncela-Casanovas J (2014) Social system as complex networks. Soc Netw Anal Min 4(1):238","journal-title":"Soc Netw Anal Min"},{"key":"693_CR15","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier, Amsterdam"},{"issue":"4","key":"693_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2016","unstructured":"Harper FM, Konstan JA (2016) The movielens datasets: history and context. ACM Trans Interact Intell Syst 5(4):1\u201319","journal-title":"ACM Trans Interact Intell Syst"},{"key":"693_CR17","doi-asserted-by":"crossref","unstructured":"Ilaria B, Sylvie H, Guillaume D, Floriana G (2018) The anatomy of a web of trust: the Bitcoin-OTC market. In: International conference on social informatics, Springer, Berlin, pp 228\u2013241","DOI":"10.1007\/978-3-030-01129-1_14"},{"issue":"4","key":"693_CR18","doi-asserted-by":"publisher","first-page":"e59613","DOI":"10.1371\/journal.pone.0059613","volume":"8","author":"S Iyer","year":"2013","unstructured":"Iyer S, Killingback T, Sundaram B, Wang Z (2013) Attack robustness and centrality of complex networks. PLoS ONE 8(4):e59613","journal-title":"PLoS ONE"},{"key":"693_CR19","first-page":"51","volume":"2019","author":"O Kardos","year":"2019","unstructured":"Kardos O, London A, Vink\u00f3 T (2019) A simulator to study the stability of network centrality measure. Proc MATCOS 2019:51\u201354","journal-title":"Proc MATCOS"},{"issue":"1\/2","key":"693_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81\u201393","journal-title":"Biometrika"},{"key":"693_CR21","doi-asserted-by":"crossref","unstructured":"Kumar S, Spezzano F, Subrahmanian V, Faloutsos C (2016) Edge weight prediction in weighted signed networks. In: Proceedings of the 16th international conference on data mining (ICDM), IEEE, pp 221\u2013230","DOI":"10.1109\/ICDM.2016.0033"},{"key":"693_CR22","doi-asserted-by":"crossref","unstructured":"Kumar S, Hamilton WL, Leskovec J, Jurafsky D (2018a) Community interaction and conflict on the web. In: Proceedings of the 2018 world wide web conference, ACM, Cambridge, pp 933\u2013943","DOI":"10.1145\/3178876.3186141"},{"key":"693_CR23","doi-asserted-by":"crossref","unstructured":"Kumar S, Hooi B, Makhija D, Kumar M, Faloutsos C, Subrahmanian V (2018b) Rev2: fraudulent user prediction in rating platforms. In: Proceedings of the 11th international conference on web search and data mining. ACM, Cambridge, pp 333\u2013341","DOI":"10.1145\/3159652.3159729"},{"issue":"1","key":"693_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1540-6288.1987.tb00318.x","volume":"22","author":"CG Lamoureux","year":"1987","unstructured":"Lamoureux CG, Wansley JW (1987) Market effects of changes in the Standard & Poor\u2019s 500 index. Financ Rev 22(1):53\u201369","journal-title":"Financ Rev"},{"key":"693_CR25","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: Stanford large network dataset collection. https:\/\/2.zoppoz.workers.dev:443\/http\/snap.stanford.edu\/data Accessed 20 Sept (2019)"},{"key":"693_CR26","first-page":"539","volume":"25","author":"J Leskovec","year":"2012","unstructured":"Leskovec J, Mcauley JJ (2012) Learning to discover social circles in ego networks. Adv Neural Inf Process Syst 25:539\u2013547","journal-title":"Adv Neural Inf Process Syst"},{"key":"693_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010) Governance in social media: a case study of the Wikipedia promotion process. In: Proceedings of the 4th international conference on weblogs and social media, AAAI","DOI":"10.1145\/1753326.1753532"},{"issue":"1","key":"693_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s100510050929","volume":"11","author":"RN Mantegna","year":"1999","unstructured":"Mantegna RN (1999) Hierarchical structure in financial markets. Eur Phys J B\u2014Condens Matter Compl Syst 11(1):193\u2013197","journal-title":"Eur Phys J B\u2014Condens Matter Compl Syst"},{"issue":"4","key":"693_CR29","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0049-089X(73)90010-0","volume":"2","author":"U Nieminen","year":"1973","unstructured":"Nieminen U (1973) On the centrality in a directed graph. Soc Sci Res 2(4):371\u2013378","journal-title":"Soc Sci Res"},{"key":"693_CR30","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.physa.2015.06.031","volume":"438","author":"Q Niu","year":"2015","unstructured":"Niu Q, Zeng A, Fan Y, Di Z (2015) Robustness of centrality measures against network manipulation. Physica A 438:124\u2013131","journal-title":"Physica A"},{"key":"693_CR31","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: Proceedings of the 10th international conference on web search and data mining, ACM, pp 601\u2013610","DOI":"10.1145\/3018661.3018731"},{"issue":"1","key":"693_CR32","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s13278-016-0371-8","volume":"6","author":"A Rezvanian","year":"2016","unstructured":"Rezvanian A, Meybodi MR (2016) Sampling algorithms for weighted networks. Soc Netw Anal Min 6(1):60","journal-title":"Soc Netw Anal Min"},{"issue":"4","key":"693_CR33","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31(4):581\u2013603","journal-title":"Psychometrika"},{"key":"693_CR34","series-title":"Lecture notes in social networks","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-89932-9_7","volume-title":"Machine learning techniques for online social networks","author":"S Sarkar","year":"2018","unstructured":"Sarkar S, Kumar S, Bhowmick S, Mukherjee A (2018) Centrality and community scoring functions in incomplete networks: their sensitivity, robustness, and reliability. Machine learning techniques for online social networks. Lecture notes in social networks. Springer, Berlin, pp 135\u2013154"},{"issue":"3","key":"693_CR35","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TSP.2015.2486740","volume":"64","author":"S Segarra","year":"2015","unstructured":"Segarra S, Ribeiro A (2015) Stability and continuity of centrality measures in weighted graphs. IEEE Trans Signal Process 64(3):543\u2013555","journal-title":"IEEE Trans Signal Process"},{"issue":"1","key":"693_CR36","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/00223980.1954.9712925","volume":"38","author":"ME Shaw","year":"1954","unstructured":"Shaw ME (1954) Group structure and the behavior of individuals in small groups. J Psychol 38(1):139\u2013149","journal-title":"J Psychol"},{"issue":"4","key":"693_CR37","first-page":"131","volume":"44","author":"J Treynor","year":"1966","unstructured":"Treynor J, Mazuy K (1966) Can mutual funds outguess the market. Harvard Bus Rev 44(4):131\u2013136","journal-title":"Harvard Bus Rev"},{"key":"693_CR38","doi-asserted-by":"crossref","unstructured":"Valle MA, Ruz GA, Morr\u00e1s R (2018) Market basket analysis using minimum spanning trees. Network intelligence meets user centered social media networks. Lecture notes in social networks. Springer, Berlin, pp 155\u2013167","DOI":"10.1007\/978-3-319-90312-5_11"},{"issue":"1","key":"693_CR39","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.socnet.2004.11.010","volume":"27","author":"B Zemlji\u010d","year":"2005","unstructured":"Zemlji\u010d B, Hlebec V (2005) Reliability of measures of centrality and prominence. Soc Netw 27(1):73\u201388","journal-title":"Soc Netw"},{"key":"693_CR40","doi-asserted-by":"crossref","unstructured":"Zweig KA (2016) Centrality indices. Network analysis literacy: a practical approach to the analysis of networks. Lecture notes in social networks. Springer, Berlin, pp 243\u2013276","DOI":"10.1007\/978-3-7091-0741-6_9"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00693-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s13278-020-00693-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s13278-020-00693-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T07:58:28Z","timestamp":1696665508000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s13278-020-00693-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,16]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["693"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s13278-020-00693-0","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,16]]},"assertion":[{"value":"6 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"80"}}