Description Usage Arguments Author(s)
Approximate the probability of interactions between two subgraphs, a bipartite comparison.
1 | comp_bipartite_prob(v1, v2, G, exact = TRUE)
|
v1 |
vector of vertex identifiers, indicating the vertices present in subgraph 1. Vertex identifiers need to be the names of vertices in G. "v1" vertices will be used to create g1 subgraph. |
v2 |
vector of vertex identifiers. Same criteria as L1. L1 and L2 for comparison should not have zero intersection. Vertices in both L1 and L2 will be removed during analysis. "v2" vertices will be used to create g2 subgraph. |
G |
igraph object of which g1 and g2 subgraphs will be created from. |
exact |
logical. If TRUE, the approximation of the probability is calculated rather than approximated by 'ppois()'. |
Christopher Nobles, Ph.D.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.