| centrality_expected | R Documentation |
Expected centrality is the sum of the degrees of a node's neighbors:
E(v) = \sum_{u \in N(v)} k_u.
centrality_expected(x, mode = "all", ...)
x |
Network input accepted by |
mode |
For directed networks: |
... |
Further arguments to |
Edge weights are ignored. mode sets both the degrees and the
neighbor set. On a directed network mode = "all" uses total degrees
and the undirected neighbor set. Adding the node's own degree gives the
"kandhway_kuri" form of centrality_diffusion.
A named numeric vector with one score per node, in input node order.
centrality_diffusion,
centrality_neighborhood_connectivity,
centrality.
centrality_expected(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.