View source: R/centrality-batch14.R
| centrality_diffusion_centrality | R Documentation |
Diffusion centrality (Banerjee et al. 2013) counts the walks of length
1 to T that start at a node, each discounted by q per step:
DC(A; q, T) = \sum_{t=1}^{T} (qA)^t \mathbf{1}.
Walks may revisit nodes and return to the source, so the score counts repeated hearings of a message.
centrality_diffusion_centrality(x, diffusion_q = 1, diffusion_steps = 3, ...)
x |
Network input accepted by |
diffusion_q |
Discount |
diffusion_steps |
Horizon |
... |
Further arguments to |
A holds the edge weights, or ones with weighted = FALSE.
Directed edges carry information from source to target, so the score
uses row sums and mode has no effect. Transposing the input
gives incoming walks. Self-loops follow loops. Negative or non-finite
weights raise an error. T = 0 gives 0 and T = 1 gives
q times the out-strength. When every entry of qA lies
between 0 and 1 the score is the expected number of times the
information is heard (Banerjee et al. 2013), and it can exceed the
number of nodes. The defaults q = 1 and T = 3 are package
choices. This measure differs from centrality_diffusion.
A named numeric vector with one score per node, in input node order.
Banerjee, A., Chandrasekhar, A. G., Duflo, E., & Jackson, M. O. (2013). The Diffusion of Microfinance. Science, 341, 1236498. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1126/science.1236498")}.
Banerjee, A., Chandrasekhar, A. G., Duflo, E., & Jackson, M. O. (2019). Using Gossips to Spread Information: Theory and Evidence from Two Randomized Controlled Trials. Review of Economic Studies, 86, 2453-2490. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1093/restud/rdz008")}.
centrality_dynamics_sensitive,
centrality_diffusion, centrality.
centrality_diffusion_centrality(regulation_net)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.