Abstract
The decay centrality (DEC) metric for a vertex weighs the distance of the vertex to the rest of the vertices on the basis of a decay parameter (0 < δ < 1). In this paper, we analyze a suite of 48 real-world networks and compute the DEC values for δ values ranging from 0.01 to 0.99 for each of these networks. We explore the presence of a particular or range of δ values within which there is a very strong positive correlation (Pearson’s correlation coefficient of 0.8 or above) between DEC and each of the four commonly studied centrality metrics: degree centrality (DEG), eigenvector centrality (EVC), betweenness centrality (BWC) and closeness centrality (CLC). We observe 0.01 to be the most appropriate δ value for which there exists a very strong positive correlation between DEC and each of DEG, EVC and BWC for at least 50% of the networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Freeman, L.C.: Centrality in social networks: conceptual clarification. Soc. Netw. 1(3), 215–239 (1979)
Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170–1182 (1987)
Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001)
Tsakas, N.: On decay centrality. arXiv:1604.05582 (2016)
Evans, J.D.: Straightforward Statistics for the Behavioral Sciences. Brooks Cole Publishing Company, Pacific Grove (1995)
Lay, D.C., Lay, S.R., McDonald, J.J.: Linear Algebra and its Applications. Pearson, London (2015)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009)
Meghanathan, N.: Spectral radius as a measure of variation in node degree for complex network graphs. In: Proceedings of the 3rd International Conference on Digital Contents and Applications, Hainan, China, pp. 30–33 (2014)
Renyi, E.: On random graphs I. Publicationes Mathematicae 6, 290–297 (1959)
Barabasi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Li, C., Li, Q., Van Mieghem, P., Stanley, H.E., Wang, H.: Correlation between centrality metrics and their application to the opinion model. Eur. Phys. J. B 88(65), 1–13 (2015)
Meghanathan, N.: Correlation coefficient analysis of centrality metrics for complex network graphs. In: Silhavy, R., Senkerik, R., Oplatkova, Z.K., Prokopova, Z., Silhavy, P. (eds.) Intelligent Systems in Cybernetics and Automation Theory. AISC, vol. 348, pp. 11–20. Springer, Cham (2015). doi:10.1007/978-3-319-18503-3_2
Meghanathan, N.: A computationally-lightweight and localized centrality metric in lieu of betweenness centrality for complex network analysis. Vietnam J. Comput. Sci. 4(1), 23–38 (2017). Springer
Greene, W.H.: Econometric Analysis. Pearson, London (2011)
Meghanathan, N.: Correlation coefficient analysis: centrality vs. maximal clique size for complex real-world network graphs. Int. J. Netw. Sci. 1(1), 3–27 (2016)
Acknowledgments
The research is financed by the NASA EPSCoR sub award (#: NNX14AN38A) from University of Mississippi.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Meghanathan, N. (2017). Correlation Analysis of Decay Centrality. In: Silhavy, R., Senkerik, R., Kominkova Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds) Cybernetics and Mathematics Applications in Intelligent Systems. CSOC 2017. Advances in Intelligent Systems and Computing, vol 574. Springer, Cham. https://doi.org/10.1007/978-3-319-57264-2_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-57264-2_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57263-5
Online ISBN: 978-3-319-57264-2
eBook Packages: EngineeringEngineering (R0)