Detection of hubs in complex networks by the Laplacian matrix

Abstract

We propose a definition of hub in complex networks by using the eigenvectors of the Laplacian matrix, and suggest a method of detecting hubs. The proposed definition provides a different concept from the classical measures such as the centrality or degree. Also, a method of determining the number of hubs is suggested using a scree plot. Illustrative examples based on artificial data sets and real data sets are given. © 2020, Korean Statistical Society.