Core of communities in bipartite networks
arXiv:1704.01524 · doi:10.1103/PhysRevE.96.022321
Abstract
We use the information present in a bipartite network to detect cores of communities of each set of the bipartite system. Cores of communities are found by investigating statistically validated projected networks obtained using information present in the bipartite network. Cores of communities are highly informative and robust with respect to the presence of errors or missing entries in the bipartite network. We assess the statistical robustness of cores by investigating an artificial benchmark network, the co-authorship network, and the actor-movie network. The accuracy and precision of the partition obtained with respect to the reference partition are measured in terms of the adjusted Rand index and of the adjusted Wallace index respectively. The detection of cores is highly precise although the accuracy of the methodology can be limited in some cases.
arXiv comment9 pages, 6 figures
References in corpus (27)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Community detection in graphs
- Natural Scales in Geographical Patterns
- Maps of random walks on complex networks reveal community structure
- The structure of scientific collaboration networks
- Resolution limit in community detection
- Analysis of weighted networks
- Statistical Mechanics of Community Detection
- Community detection in networks: A user guide
- Finding statistically significant communities in networks
- The performance of modularity maximization in practical contexts
- Extracting the multiscale backbone of complex weighted networks
- Modularity and community detection in bipartite networks
- Mapping change in large networks
- Limits of modularity maximization in community detection
- Analysis of the structure of complex networks at different resolution levels
- Module identification in bipartite and directed networks
- Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
- Laplacian Dynamics and Multiscale Modular Structure in Networks
- Robustness of community structure in networks
- Statistically validated networks in bipartite complex systems
- Scalable detection of statistically significant communities and hierarchies, using message-passing for modularity
- Efficiently inferring community structure in bipartite networks
- Statistical significance of communities in networks
- Inferring monopartite projections of bipartite networks: an entropy-based approach
- Statistically validated network of portfolio overlaps and systemic risk
Cited by in corpus (6)
- Meta-validation of bipartite network projections
- Detecting mesoscale structures by surprise
- Bootstrap validation of links of a minimum spanning tree
- Nonparametric sign prediction of high-dimensional correlation matrix coefficients
- Network topology mapping of Chemical Compounds Space
- QMA(2) with postselection equals to NEXP