comp_lambda_bipartite: Compute the number of expected connections between two sets...
In cnobles/spraphal: Sparse Graph-based Analysis
Description
Usage
Arguments
Author(s)
Description
Compute the number of expected connections between two sets of vertices.
Usage
1
comp_lambda_bipartite(v1, v2, G)
Arguments
v1
vector of vertex identifiers for list 1.
v2
vector of vertex identifiers for list 2.
G
igraph of which vertices from v1 and v2 are present.
Author(s)
Christopher Nobles, Ph.D.
cnobles/spraphal documentation built on May 28, 2019, 7:35 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Author(s)
Description
Compute the number of expected connections between two sets of vertices.
Usage
1 | comp_lambda_bipartite(v1, v2, G)
|
Arguments
v1 |
vector of vertex identifiers for list 1. |
v2 |
vector of vertex identifiers for list 2. |
G |
igraph of which vertices from v1 and v2 are present. |
Author(s)
Christopher Nobles, Ph.D.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.