comp_sparse_prob: Compute probability for sparse graph edges.
In cnobles/spraphal: Sparse Graph-based Analysis
Description
Usage
Arguments
Author(s)
Description
Compute probability for sparse graph edges.
Usage
1
comp_sparse_prob(lambda, edgeCnt, maxEdgeCnt, exact = TRUE)
Arguments
lambda
expected connections between verticies, computed by
'comp_lambda' or 'comp_lambda_bipartite'.
edgeCnt
count of edges present between the verticies tested.
maxEdgeCnt
maximal count of edges possible in graph or subgraph.
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 probability for sparse graph edges.
Usage
1 | comp_sparse_prob(lambda, edgeCnt, maxEdgeCnt, exact = TRUE)
|
Arguments
lambda |
expected connections between verticies, computed by 'comp_lambda' or 'comp_lambda_bipartite'. |
edgeCnt |
count of edges present between the verticies tested. |
maxEdgeCnt |
maximal count of edges possible in graph or subgraph. |
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.