Description Usage Arguments Details Value Author(s) References See Also
Calculates the leverage centrality of each vertex in a graph.
1 |
g |
An |
A |
Numeric matrix; the adjacency matrix of the input graph. Default:
|
The leverage centrality relates a vertex's degree with the degree of its neighbors. The equation is:
l_i = \frac{1}{k_i} ∑_{j \in N_i} \frac{k_i - k_j}{k_i + k_j}
where k_i is the degree of the i^{th} vertex and N_i is the set of neighbors of i. This function replaces NaN with NA (for functions that have the argument na.rm).
A vector of the leverage centrality for all vertices.
Christopher G. Watson, cgwatson@bu.edu
Joyce, K.E. and Laurienti P.J. and Burdette J.H. and Hayasaka S. (2010) A new measure of centrality for brain networks. PLoS One, 5(8), e12200. https://dx.doi.org/10.1371/journal.pone.0012200
Other Centrality functions: centr_betw_comm
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.