Networks
Co-offending graphs, centrality, cores, components, communities, brokerage and the Cheeger bounds.
| Function | What it computes | Command line and bindings |
|---|---|---|
coofg() |
Co-offending graph from an incident table | |
ntdeg() |
Degree and strength of each node | |
ntbtw() |
Betweenness of each node | |
ntcls() |
Closeness of each node | |
ntevc() |
Eigenvector centrality of each node | |
ntcore() |
k-core of each node | |
ntcmp() |
Connected components | |
ntlvn() |
Communities by the Louvain method | |
ntmod() |
Modularity of a partition | |
ntbrk() |
Brokerage roles | |
ntchg() |
Cheeger bounds on a network’s bottleneck |
Each name links to its R help page, which gives the method, its source and a worked example. The other languages use the same names and the same arguments.