Two-step expected influence (Robinaugh, Millner and McNally 2016) adds to the one-step expected influence of a node the one-step expected influence of its neighbors, each weighted by the signed edge between them: $$EI_2(i) = EI_1(i) + \sum_{j} w_{ij} EI_1(j).$$
Arguments
- x
Network input accepted by
centrality.- mode
For directed networks:
"out"(default),"in"or"all".- ...
Further arguments to
centrality, such asnormalizedandpsych_network.
Details
mode = "out" (the default here) follows outgoing edges at both
steps, mode = "in" incoming edges and mode = "all" both, with
a self-loop counted once. On an undirected network the three modes
agree and each edge is counted once. weighted = FALSE gives every
edge weight one. When the
network has a negative edge, normalized = TRUE divides by the
largest absolute score and keeps the sign.
References
Robinaugh, D. J., Millner, A. J., & McNally, R. J. (2016). Identifying highly influential nodes in the complicated grief network. Journal of Abnormal Psychology, 125(6), 747-757. doi:10.1037/abn0000181 .
