comp_pij: Compute the probability of vertex i connecting to vertex j.
In cnobles/spraphal: Sparse Graph-based Analysis
Description
Usage
Arguments
Author(s)
Description
Compute the probability of vertex i connecting to vertex j.
Usage
1
Arguments
ki
integer degree of vertex i
kj
integer degree of vertex j
M
integer size of graph G, the total number of edges within G.
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 probability of vertex i connecting to vertex j.
Usage
1 |
Arguments
ki |
integer degree of vertex i |
kj |
integer degree of vertex j |
M |
integer size of graph G, the total number of edges within G. |
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.