Nothing
Counts occurrences of motifs in bipartite networks, as well as the number of times each node or link appears in each unique position within motifs. Has support for both binary and weighted motifs: can calculate the mean weight of motifs and the standard deviation of their mean weights. Intended for use in ecology, but its methods are general and can be applied to any bipartite network. Full details are given in Simmons et al. (2019) <doi:10.1111/2041-210X.13149>.
Package details |
|
---|---|
Author | Benno Simmons [aut, cre], Michelle Sweering [aut], Maybritt Schillinger [aut], Riccardo Di Clemente [aut] |
Maintainer | Benno Simmons <benno.simmons@gmail.com> |
License | MIT + file LICENSE |
Version | 2.0.2 |
Package repository | View on CRAN |
Installation |
Install the latest version of this package by entering the following in R:
|
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.