WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 17, 2018
Weighted Modularity on k-Path Graph
Authors: ,
Abstract: This Community detection is one of the most interesting problems in the study of social networks. Most of the recent studies focused on how to design algorithms to find the communities without knowing the number of communities in advance. In this paper, we define the k-path graph, and generalize Newman’s modularity as weighted modularity. It is also highlight the relationship between eigenvalues and the number of communities of social networks in this paper.