Correlation Analysis between Maximal Clique Size and Centrality Metrics for Random Networks and Scale-Free Networks

摘要

The high-level contribution of this paper is a comprehensive analysis of the correlation levels between node centrality (a computationally light-weight metric) and maximal clique size (a computationally hard metric) in random network and scale-free network graphs generated respectively from the well-known Erdos-Renyi (ER) and Barabasi-Albert (BA) models. We use three well-known measures for evaluating the level of correlation: Product-moment based Pearson's correlation coefficient, Rank-based Spearman's correlation coefficient and Concordance-based Kendall's correlation coefficient. For each of the several variants of the theoretical graphs generated from the ER and BA models, we compute the above three correlation coefficient values between the maximal clique size for a node (maximum size of the clique the node is part of) and each of the four prominent node centrality metrics (degree, eigenvector, betweenness and closeness). 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.