Description Usage Arguments Value Author(s) References Examples
Computes eigenvector
centrality over nodes in a subset of nodes
in the network. This measure generalizes across any subset of nodes and
is not specific to communities
1 | flow.frac(A, nodes)
|
A |
An adjacency matrix |
nodes |
A subset of nodes in the network |
Returns a flow fraction value
Alexander Christensen <alexpaulchristensen@gmail.com>
Giscard, P. L., & Wilson, R. C. (2018). A centrality measure for cycles and subgraphs II. Applied Network Science, 3, 9.
1 2 3 4 5 6 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.