Description Usage Arguments Author(s)
Compute probability for sparse graph edges.
1 | comp_sparse_prob(lambda, edgeCnt, maxEdgeCnt, exact = TRUE)
|
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. |
Christopher Nobles, Ph.D.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.