Influence via all paths penalized by distance. Similar to eigenvector centrality but includes an exogenous contribution, making it well-defined even for directed acyclic graphs.
Arguments
- x
Network input (matrix, igraph, network, cograph_network, tna object).
- mode
For directed networks:
"all"(default),"in", or"out".- ...
Additional arguments passed to
centrality(e.g.,normalized,weighted,directed).
See also
centrality for computing multiple measures at once,
centrality_eigenvector for a related measure.
