Centrality and Community Scoring Functions in Incomplete Networks: Their Sensitivity, Robustness, and Reliability

Stability of network centrality measures: a numerical study

“…Although the concept of node centrality measures' stability has been investigated in the literature of complex networks and centrality measures (Costenbader and Valente 2003;Zemljič and Hlebec 2005;Borgatti et al 2006;Boldi et al 2013;Iyer et al 2013;Niu et al 2015;Segarra and Ribeiro 2015;Sarkar et al 2018), one can find considerably less papers that discuss more than one graph perturbation method at a time. In the cited papers, empirical experiments were performed by comparing the initial graph or network with a modified version of the original one with respect to some randomization processes.…”

“…Graph sampling, edge weight perturbation, removing or adding new edges are considered as perturbation methods in these studies. Borgatti et al (2006) and Sarkar et al (2018) both investigated the robustness of centrality measures under conditions of imperfect data and incomplete networks. Sarkar et al (2018) studied the effect of noise in complex networks and performed sensitivity, robustness, and reliability-related analyses.…”

“…Borgatti et al (2006) and Sarkar et al (2018) both investigated the robustness of centrality measures under conditions of imperfect data and incomplete networks. Sarkar et al (2018) studied the effect of noise in complex networks and performed sensitivity, robustness, and reliability-related analyses. Borgatti et al (2006) added random error to different networks with varying sizes and densities.…”