The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
A method for detecting modules in quantitative bipartite networks
Open accessAbstract
Summary: Ecological networks are often composed of different subcommunities (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 specialization. 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 QuanBiMo, sketch its performance on simulated data and illustrate its potential usefulness with a case study. Modules are detected with a higher accuracy in simulated quantitative networks than in their binary counterparts. Even at high levels of noise, QuanBiMo still classifies 70% of links correctly as within‐ or between‐modules. Recursively applying the algorithm results in additional information of within‐module organization of the network. The algorithm introduced here must be seen as a considerable improvement over the current standard of algorithms for binary networks. Due to its higher sensitivity, it is likely to lead to be useful for detecting modules in the typically noisy data of ecological networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
The modularity of pollination networks
Olesen, J. M., Bascompte, J., Dupont, Y. L., & Jordano, P. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0706375104 · Cited by 2,639
The nested assembly of plant–animal mutualistic networks
Bascompte, J., Jordano, P., Melián, C. J., & Olesen, J. M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1633576100 · Cited by 2,497
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.056131 · Cited by 2,476
Cited by
Improved community detection in weighted bipartite networks
Beckett, S. J. (2016) · Royal Society Open Science · doi:10.1098/rsos.140536 · Cited by 530
Ecological networks of dissolved organic matter and microorganisms under global change
Hu, A., Choi, M., Tanentzap, A. J., Liu, J., Jang, K.-S., Lennon, J. T., Liu, Y., Soininen, J., Lu, X., Zhang, Y., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-31251-1 · Cited by 330
Honeybees disrupt the structure and functionality of plant-pollinator networks
Valido, A., Rodríguez-Rodríguez, M. C., & Jordano, P. (2019) · Scientific Reports · doi:10.1038/s41598-019-41271-5 · Cited by 284
Pichler, M., Boreux, V., Klein, A., Schleuning, M., & Hartig, F. (2020) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13329 · Cited by 149
Metadata
- Authors
- Dormann, C. F., & Strauss, R.
- Venue
- Methods in Ecology and Evolution
- Publisher
- Wiley
- Published
- 2013-12-05
- Volume
- 5
- Issue
- 1
- Pages
- 90-98
- ISSN
- 2041-210X (ISSN-L)
- OpenAlex
- W1647225459
- Cited by
- 533
- References
- 55
- FWCI
- 13.87
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A method for detecting modules in quantitative bipartite networks. https://app.cochat.ai/papers/10.1111/2041-210x.12139
- The paper
- Dormann, C. F., & Strauss, R. (2014). A method for detecting modules in quantitative bipartite networks. Methods in Ecology and Evolution. https://doi.org/10.1111/2041-210x.12139
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.