Counting Motifs in Bipartite Networks

Counts occurrences of motifs in bipartite networks, as well as the number of times each node appears in each unique position within motifs. Intended for use in ecology, but its methods are general and can be applied to any bipartite network.


Build Status codecov

Overview

bmotif counts occurrences of motifs in bipartite networks, as well as the number of times each node appears in each unique position within motifs. bmotif was intended for use in ecology but its methods are general and can be applied to any bipartite graph.

Installation

To install the released version from CRAN:

install.packages("bmotif")

To install the development version from GitHub:

install.packages("devtools") # install the devtools package
devtools::install_github("SimmonsBI/bmotif") # install bmotif

Use

bmotif considers all 44 unique bipartite motifs up to six nodes. Within these motifs there are 148 unique positions.

bmotif has two functions: mcount and positions. mcount counts occurrences of motifs in a bipartite network. positions counts the number of times each node in a network occurs in each of the positions within the motifs.

News

1.0.0

  • mcount() counts the number of motifs up to 6 nodes in a bipartite network.
  • positions() counts the number of times each node in a bipartite network occurs in each unique position in each of the motifs up to 6 nodes.

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("bmotif")

1.0.0 by Benno Simmons, a year ago


Browse source code at https://github.com/cran/bmotif


Authors: Benno Simmons [aut, cre] , Michelle Sweering [aut] , Riccardo Di Clemente [aut]


Documentation:   PDF Manual  


MIT + file LICENSE license


Imports tensor

Suggests testthat


See at CRAN