SurpriseMe: an integrated tool for network community structure characterization using Surprise maximization
arXiv:1310.2357 · doi:10.1093/bioinformatics/btt741
Abstract
Detecting communities, densely connected groups may contribute to unravel the underlying relationships among the units present in diverse biological networks (e.g., interactome, coexpression networks, ecological networks, etc.). We recently showed that communities can be very precisely characterized by maximizing Surprise, a global network parameter. Here we present SurpriseMe, a tool that integrates the outputs of seven of the best algorithms available to estimate the maximum Surprise value. SurpriseMe also generates distance matrices that allow to visualize the relationships among the solutions generated by the algorithms. We show that the communities present in small and medium-sized networks, with up to 10.000 nodes, can be easily characterized: on standard PC computers, these analyses take less than an hour. Also, four of the algorithms may quite rapidly analyze networks with up to 100.000 nodes, given enough memory resources. Because of its performance and simplicity, SurpriseMe is a reference tool for community structure characterization.
6 pages
References in corpus (8)
- Maps of random walks on complex networks reveal community structure
- Comparing community structure identification
- Statistical Mechanics of Community Detection
- Narrow scope for resolution-limit-free community detection
- Surprise maximization reveals the community structure of complex networks
- Exploring the limits of community detection strategies in complex networks
- Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering
- Closed benchmarks for network community structure characterization