Detecting modules in quantitative bipartite networks: the QuaBiMo algorithm
arXiv:1304.3218 · doi:10.1111/2041-210X.12139
Abstract
Ecological networks are often composed of different sub-communities (often referred to as modules). Identifying such modules has the potential to develop a better understanding of the assembly of ecological communities and to investigate functional overlap or specialisation. The most informative form of networks are quantitative or weighted networks. Here we introduce an algorithm to identify modules in quantitative bipartite (or two-mode) networks. It is based on the hierarchical random graphs concept of Clauset et al. (2008 Nature 453: 98-101) and is extended to include quantitative information and adapted to work with bipartite graphs. We define the algorithm, which we call QuaBiMo, sketch its performance on simulated data and illustrate its potential usefulness with a case study.
arXiv comment19 pages, 10 figures, 4 tables
References in corpus (15)
- The structure and function of complex networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Fast algorithm for detecting community structure in networks
- Hierarchical organization of modularity in metabolic networks
- Analysis of weighted networks
- Hierarchical structure and the prediction of missing links in networks
- The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
- Modularity and community detection in bipartite networks
- Limits of modularity maximization in community detection
- Module identification in bipartite and directed networks
- Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
- Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement
Cited by in corpus (5)
- Randomizing bipartite networks: the case of the World Trade Web
- Machine learning algorithms to infer trait-matching and predict species interactions in ecological networks
- Reconstructing mesoscale network structures
- Complexity emerges in measures of the marking dynamics in football games
- Hierarchical clustering of bipartite data sets based on the statistical significance of coincidences