centrality_strength: Strength Centrality

View source: R/centrality.R

centrality_strengthR Documentation

Strength Centrality

Description

Strength (Barrat et al. 2004) is the sum of the weights of the edges incident to a node, the weighted counterpart of degree. With mode = "in" it sums incoming weights and with mode = "out" outgoing weights. centrality_instrength() and centrality_outstrength() are these two forms.

Usage

centrality_strength(x, mode = "all", ...)

centrality_instrength(x, ...)

centrality_outstrength(x, ...)

Arguments

x

Network input accepted by centrality.

mode

Direction for directed networks: "all" (default), "in" or "out".

...

Further arguments to centrality. The measure uses loops (keep self-loops, default TRUE) and normalized (default FALSE).

Details

The stored weights are summed, and weighted = FALSE gives every edge weight one, so the scores equal centrality_degree. A self-loop counts twice on an undirected network and under mode = "all", and once under "in" or "out"; loops = FALSE drops it. Negative weights are summed with their sign. normalized = TRUE divides the scores by their maximum.

Value

A named numeric vector with one score per node, in input node order.

References

Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747-3752. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1073/pnas.0400087101")}.

See Also

centrality_degree, centrality.

Examples

centrality_strength(regulation_net)

cograph documentation built on Nov. 19, 2026, 5:07 p.m.