The investigation of community structures is one of the most important problems in the field of complex networks and has countless applications in different disciplines: biology, computer, social sciences, etc. Many community detection algorithms have been developed in various fields recently....

A simple deterministic algorithm for community detection is provided by using two rounds of minimum spanning trees. By comparing the first round minimum spanning tree (1st-MST) with the second round spanning tree (2nd-MST) of the network, communities are detected and their overlapping nodes are...

In this paper, we propose a simple random network model with overlapping communities controlled by several parameters, and investigate the influence of the overlapping community structure on the synchronization behavior under different parameters. It is found that the synchronizability of the...