Ensembles based on the Rich-Club and how to use them to build soft-communities
arXiv:1504.05782
Abstract
Ensembles of networks are used as null-models to discriminate network structures. We present an efficient algorithm, based on the maximal entropy method to generate network ensembles defined by the degree sequence and the rich-club coefficient. The method is applicable for unweighted, undirected networks. The ensembles are used to generate correlated and uncorrelated null--models of a real networks. These ensembles can be used to define the partition of a network into soft communities.
16 pages, 5 figures
References in corpus (7)
- Finding community structure in networks using the eigenvectors of matrices
- Resolution limit in community detection
- Finding statistically significant communities in networks
- The Rich-Club Phenomenon In The Internet Topology
- Robustness of community structure in networks
- The entropy of network ensembles
- Identifying "communities" within energy landscapes