المؤلفون: Meghanathan, Natarajan

المصدر: Egyptian Informatics Journal; Sep2021, Vol. 22 Issue 3, p339-355, 17p

مصطلحات موضوعية: STATISTICAL correlation, SCALE-free network (Statistical physics), RANK correlation (Statistics), PEARSON correlation (Statistics), CENTRALITY, RANDOM graphs, EIGENVECTORS, SIZE

مصطلحات جغرافية: KENDALL (Fla.)

مستخلص: We seek to identify one or more computationally light-weight centrality metrics that have a high correlation with that of the maximal clique size (the maximum size of the clique a node is part of) - a computationally hard measure. In this pursuit, we compute three well-known measures of evaluating the correlation between two datasets: Product-moment based Pearson's correlation coefficient, Rank-based Spearman's correlation coefficient and Concordance-based Kendall's correlation coefficient. We compute the above three correlation coefficient values between the maximal clique size and each of the four prominent node centrality metrics (degree, eigenvector, betweenness and closeness) for random network graphsand scale-free network graphs as well as for a suite of ten real-world network graphs whose degree distribution ranges from random to scale-free. We also explore the impact of the operating parameters of the theoretical models for generating random networks and scale-free networks on the correlation between maximal clique size and the centrality metrics. [ABSTRACT FROM AUTHOR]

: Copyright of Egyptian Informatics Journal is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)