| centrality_decay | R Documentation |
Decay centrality sums a decay factor \delta raised to the
distance from the node to every node:
D(v) = \sum_{w} \delta^{d(v, w)}.
The sum includes the node itself, which adds one to every score, and
unreachable nodes contribute 0. Values of \delta between 0
and 1 discount distant nodes.
centrality_decay(x, mode = "all", decay_parameter = 0.5, ...)
x |
Network input accepted by |
mode |
For directed networks: |
decay_parameter |
Decay factor |
... |
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.
decay_parameter must lie strictly between 0 and 1, and other values
raise a cograph_bad_parameter error. centrality_generalized_closeness computes
the same quantity, and decay_parameter = 0.5 gives
centrality_dangalchev.
A named numeric vector with one score per node, in input node order.
centrality_generalized_closeness,
centrality_dangalchev, centrality.
centrality_decay(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.