A generalised significance test for individual communities in networks.

ABSTRACT: Many empirical networks have community structure, in which nodes are densely interconnected within each community (i.e., a group of nodes) and sparsely across different communities. Like other local and meso-scale structure of networks, communities are generally heterogeneous in various aspects such as the size, density of edges, connectivity to other communities and significance. In the present study, we propose a method to statistically test the significance of individual communities in a given network. Compared to the previous methods, the present algorithm is unique in that it accepts different community-detection algorithms and the corresponding quality function for single communities. The present method requires that a quality of each community can be quantified and that community de

SUBMITTER: Kojaku S 

PROVIDER: S-EPMC5943579 | biostudies-literature | 2018 May

REPOSITORIES: biostudies-literature