Description Usage Arguments Details Value Author(s) References See Also Examples
View source: R/closeness_centr.R
This function is a convenience wrapper for igraph's closeness function for consistency with rsfcNet's naming conventions.
1 | closeness_centr(graph, weights = abs(E(graph)$weight))
|
graph |
A network as an igraph object or matrix. |
weights |
a vector of edge weights. Defaults to the absolute value of the input network. |
Closeness centrality gives the average shortest path length betwen a node i and all other nodes.
\frac{N-1}{∑_{j\neq i}^N d(n_i,e_{ij})}
A vector of centrality scores for each node.
Brandon Vaughan
Fornito, A., Zalesky, A., & Bullmore, E. (2016). Centrality and Hubs. Chapter 5. Fundamentals of Brain Network Analysis, 137-161. doi:10.1016/b978-0-12-407908-3.00005-4
Freeman, L.C. (1979). Centrality in Social Networks I: Conceptual Clarification. Social Networks, 1, 215-239.
closeness_centr_mult
current_centr
1 | closeness = closeness_centr_mult(graphs,row.names = subj_numbers,col.names = node_labels)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.