Importance for spreading processes using node states. Each node has a state (0-1) representing how activated it is. When all states are equal, equivalent to betweenness.
Arguments
- x
Network input (matrix, igraph, network, cograph_network, tna object).
- states
Named numeric vector of node states (0-1). Default
NULL(all nodes get state 1).- ...
Additional arguments passed to
centrality(e.g.,weighted,directed).
See also
centrality for computing multiple measures at once,
centrality_betweenness which this generalizes.
