Community Detection Algorithm Based on Complete Subgraph

Nodes in the same community are connected densely,and nodes from different communities are connected sparsely.According to this character,if two nodes and any other one node can constitute three-node complete subgraph,the two nodes are considered in the same community.Some nodes are not satisfied with complete subgraph,or are satisfied with complete subgraph for different communities at same time.A node rate of community ownership is proposed for solving those problems.The algorithm is not requested to set any parameters,and it is tested on the computer-generated and real network.Experimental results show the effectiveness and correctness of the algorithm.