View source: R/met.GE.single.R
met.ge.single | R Documentation |
Calculates the global efficiency of a network.
met.ge.single(
m,
weighted = TRUE,
shortest.weight = FALSE,
normalization = TRUE,
directed = TRUE,
out = TRUE
)
m |
a square adjacency matrix. |
weighted |
if false, it binarizes the square adjacency matrix M. Geodesic distances and diameter are based only on the presence or absence of edges. |
shortest.weight |
if false, it considers the higher met.strength as the shortest path. |
normalization |
normalizes the weigths of the links i.e. divides them by the average strength of the network. |
directed |
if false, it symmetrizes the matrix. Otherwise, it calculates geodesic distances and diameter according to the directionality of the links. |
out |
if true, it considers |
The global efficiency provides a measure of how efficiently information is exchanged in a network. It can be calculated in binary or weighted networks, and for undirected or directed networks. Depending on the problematic, care is needed for the choice of calculation method (binary or weighted, directed or undirected, and using the lowest or the highest met.strength as shortest path).
An interger representing the global efficiency.
Sebastian Sosa, Ivan Puga-Gonzalez
Sosa, S. (2018). Social Network Analysis, in: Encyclopedia of Animal Cognition and Behavior. Springer.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.