| centrality_average_distance | R Documentation |
Average distance is the sum of the shortest-path distances from a node to
every node, divided by n + 1 as in the centiserve package:
AD(v) = \frac{1}{n + 1} \sum_{w} d(v, w).
Lower values mark more central nodes.
centrality_average_distance(x, mode = "all", ...)
x |
Network input accepted by |
mode |
For directed networks: |
... |
Further arguments to |
Edge weights are read as path lengths. invert_weights = TRUE uses
1/w^\alpha as the length, and weighted = FALSE
counts hops. mode sets the direction of the paths. A node that
cannot reach every other node scores Inf, so on a disconnected
network every score is Inf.
A named numeric vector with one score per node, in input node order.
centrality_barycenter,
centrality_closeness, centrality.
centrality_average_distance(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.