A network weight-based Multi-Community discovery Algorithm

Web community discovery is much important for engineering optimization, search engine design and so on. In this paper, we propose a Linear Multi-Community Partition Algorithm for Scale-free network. We first take a function to measure the weight of each node in network and generate an order series by the weight of node, then iterate the algorithm to complete web community discovery. We use different scale network to test our algorithm, the experimental results indicate that this model can effectively recognize multi-communities of scale-free network and has good fitness to complex network with non- uniform density.