Abstract
This paper tests the robustness of four centrality measures – degree, betweenness, closeness, and eignvector centrality – using graphs simulating real world networks by Stochastic Kronecker Graphs approach. Existing studies have used Erdos-Renyi (1959) random graphs which are poor match for real world networks. Stochastic Kronecker Graphs have been found to display real world network properties. Results suggest revision of some conclusions arrived at using random graphs. Mistakes in recording nodes affect accuracy of centrality measures more than mistakes in recording connections (edges). This supports conventional wisdom, and seeks revision of Borgatti et al. (2006). Supporting some existing studies, betweenness was found to be most robust of these four centrality measures, and closeness the least robust. This paper also demonstrates how confidence intervals around centrality measures can be created using simulation to help arrive at robust analysis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
