View source: R/centrality-batch13.R
| centrality_volume | R Documentation |
Volume centrality (Wehmuth and Ziviani 2011, 2013) is the sum of the
degrees of all nodes within volume_radius hops of a node, the
node itself included. Degrees are those of the whole network, so edges
that leave the neighborhood also count.
centrality_volume(x, volume_radius = 2, ...)
x |
Network input accepted by |
volume_radius |
Hop radius: a nonnegative integer or |
... |
Further arguments to |
The measure uses the simple undirected skeleton, so direction, weights, loops and parallel edges are ignored. Isolated nodes score 0. Radius 0 gives the degree, and an infinite radius gives twice the number of edges in the node's component. A radius that is negative or not a whole number raises an error.
A named numeric vector with one score per node, in input node order.
Wehmuth, K., & Ziviani, A. (2011). Distributed Assessment of Network Centrality. arXiv:1108.1067.
Wehmuth, K., & Ziviani, A. (2013). DACCER: Distributed Assessment of the Closeness CEntrality Ranking in complex networks. Computer Networks, 57, 2536-2548. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/j.comnet.2013.05.001")}.
centrality_kreach,
centrality_degree, centrality.
centrality_volume(regulation_net, volume_radius = 1)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.