| centrality_harmonic | R Documentation |
Harmonic centrality (Marchiori and Latora 2000) sums the inverse shortest-path distances from a node to the other nodes:
H(i) = \sum_{j \ne i} \frac{1}{d_{ij}},
with 1/\infty = 0, so the score is defined on
disconnected networks (Boldi and Vigna 2014).
centrality_inharmonic() and centrality_outharmonic() are the
mode = "in" and mode = "out" forms.
centrality_harmonic(x, mode = "all", ...)
centrality_inharmonic(x, ...)
centrality_outharmonic(x, ...)
x |
Network input accepted by |
mode |
Direction for directed networks: |
... |
Further arguments to |
Edge weights are read as distances, and invert_weights = TRUE
converts a weight w to the distance 1/w^\alpha.
weighted = FALSE uses hop counts. mode = "all" treats edges
as undirected, "out" uses distances from the node and "in"
distances to it. The scores equal igraph::harmonic_centrality() on
the weighted graph. normalized = TRUE divides the scores by
n - 1, as igraph::harmonic_centrality(normalized = TRUE)
does.
A named numeric vector with one score per node, in input node order.
Marchiori, M., & Latora, V. (2000). Harmony in the small-world. Physica A, 285(3-4), 539-546. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/S0378-4371(00)00311-3")}.
Boldi, P., & Vigna, S. (2014). Axioms for centrality. Internet Mathematics, 10(3-4), 222-262. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1080/15427951.2013.865686")}.
centrality_closeness,
centrality_reaching_local, centrality.
centrality_harmonic(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.