Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 16

The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.

EcologicalNetworks.jl: analysing ecological networks of species interactions

Poisot, Timothée, Bélisle, Zachary, Hoebeke, Laura, Stock, Michiel, Szefer, Piotr·2019·Ecography

Abstract

Networks are a convenient way to represent many interactions among ecological entities. The analysis of ecological networks is challenging for two reasons. First, there is a plethora of measures that can be applied (and some of them measure the same property). Second, the implementation of these measures is sometimes difficult. We present ’EcologicalNetworks.jl’, a package for the ‘Julia’ programming language. Using a layered system of types to represent several types of ecological networks, this packages offers a solid library of basic functions which can be chained together to perform the most common analyses 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1111/ecog.04310

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Figures

Image 1
CC-BY · From the PDF
Figure 2 Distribution of nestedness values for the empirical network (solid black line) and for random draws based on four null models. This analysis is frequently used to determine whether the nestedness of an observed network is significant.
Figure 2 Distribution of nestedness values for the empirical network (solid black line) and for random draws based on four null models. This analysis is frequently used to determine whether the nestedness of an observed network is significant.CC-BY · From the PDF
Figure 3 Illustration of the network (upper-left corner), probabilistic network generated by the null model, and of eight random draws. The color of each node represents its degree, and the position of species is conserved across panels.
Figure 3 Illustration of the network (upper-left corner), probabilistic network generated by the null model, and of eight random draws. The color of each node represents its degree, and the position of species is conserved across panels.CC-BY · From the PDF
Image 4
CC-BY · From the PDF
Image 5
CC-BY · From the PDF
Figure 6 Functional roles of the species in the most modular partition found. All species score very low along both axes, making them 'peripherals' - this is a strong indication that the modular structure is not meaningful.
Figure 6 Functional roles of the species in the most modular partition found. All species score very low along both axes, making them 'peripherals' - this is a strong indication that the modular structure is not meaningful.CC-BY · From the PDF
Figure 7 Output of 100 random extinction simulations, where the change in parasite richness was measured every timestep. This example shows how the basic functions of the package can be leveraged to build custom analyses rapidly.
Figure 7 Output of 100 random extinction simulations, where the change in parasite richness was measured every timestep. This example shows how the basic functions of the package can be leveraged to build custom analyses rapidly.CC-BY · From the PDF
Figure 8 Relative weights (higher weights indicates a larger chance that the interaction has been missed when sampling) in one of the host-parasite networks according to the linear filter model of Stock et al. (2017).
Figure 8 Relative weights (higher weights indicates a larger chance that the interaction has been missed when sampling) in one of the host-parasite networks according to the linear filter model of Stock et al. (2017).CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 31 references

Research works printed but not linked: 1

  1. Simmons B. I., 2018, bmotif: a package for counting motifs in bipartite networks

Cited by

Metadata

Authors
Poisot, T., Bélisle, Z., Hoebeke, L., Stock, M., & Szefer, P.
Affiliations
  • Dépt de Sciences Biologiques, Univ. de Montréal Montréal Canada
  • KERMIT, Dept of Data Analysis and Mathematical Modelling, Ghent Univ Belgium
  • Faculty of Science, Univ. of South Bohemia České Budějovice Czech Republic
Venue
Ecography
Publisher
Wiley
Published
2019-10-17
Volume
42
Issue
11
Pages
1850-1861
ISSN
  • 0906-7590
  • 1600-0587
Cited by
16
References
31
Language
en

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

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.