EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

On the sensitivity of centrality metrics

Lucia Cavallaro iD, Pasquale De Meo, Giacomo Fiumara iD, Antonio Liotta iD

PLOS ONE · 2024

DOI: 10.1371/journal.pone.0299255 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS ONE, 2024. Verfasst von Lucia Cavallaro und 3 weiteren Autor:innen. Beteiligte Einrichtung: Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands. Hauptthemen laut MEDLINE: Algorithms. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Libera Università di Bolzano, PRIN 2020 project COMMON-WEARS.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Despite the huge importance that the centrality metrics have in understanding the topology of a network, too little is known about the effects that small alterations in the topology of the input graph induce in the norm of the vector that stores the node centralities. If so, then it could be possible to avoid re-calculating the vector of centrality metrics if some minimal changes occur in the network topology, which would allow for significant computational savings. Hence, after formalising the notion of centrality, three of the most basic metrics were herein considered ( i.e ., Degree, Eigenvector, and Katz centrality). To perform the simulations, two probabilistic failure models were used to describe alterations in network topology: Uniform ( i.e ., all nodes can be independently deleted from the network with a fixed probability) and Best Connected ( i.e ., the probability a node is removed depends on its degree). Our analysis suggests that, in the case of degree, small variations in the topology of the input graph determine small variations in Degree centrality, independently of the topological features of the input graph; conversely, both Eigenvector and Katz centralities can be extremely sensitive to changes in the topology of the input graph. In other words, if the input graph has some specific features, even small changes in the topology of the input graph can have catastrophic effects on the Eigenvector or Katz centrality.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsComputer SimulationModels, TheoreticalModels, StatisticalProbability

Autor:innen und Institutionen

  • Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands.
  • DICAM Department, University of Messina, Messina, Italy.
  • MIFT Department, University of Messina, Messina, Italy.
  • Faculty of Engineering, Free University of Bozen-Bolzano, Bolzano, Italy.

ORCID-Profile: Lucia Cavallaro, Giacomo Fiumara, Antonio Liotta

Förderung

  • Libera Università di Bolzano
  • PRIN 2020 project COMMON-WEARS

Zitieren

APA

Cavallaro, L., De Meo, P., Fiumara, G., & Liotta, A. (2024). On the sensitivity of centrality metrics. PLOS ONE. https://doi.org/10.1371/journal.pone.0299255

Vancouver

Cavallaro L, De Meo P, Fiumara G, Liotta A. On the sensitivity of centrality metrics. PLOS ONE. 2024. doi:10.1371/journal.pone.0299255

BibTeX
@article{Cavallaro2024,
  author = {Cavallaro, Lucia and De Meo, Pasquale and Fiumara, Giacomo and Liotta, Antonio},
  title = {On the sensitivity of centrality metrics},
  journal = {PLOS ONE},
  year = {2024},
  doi = {10.1371/journal.pone.0299255}
}
Kostenlos starten →