met.ge.single: Global efficiency

View source: R/met.GE.single.R

met.ge.singleR Documentation

Global efficiency

Description

Calculates the global efficiency of a network.

Usage

met.ge.single(
  m,
  weighted = TRUE,
  shortest.weight = FALSE,
  normalization = TRUE,
  directed = TRUE,
  out = TRUE
)

Arguments

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

Details

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).

Value

An interger representing the global efficiency.

Author(s)

Sebastian Sosa, Ivan Puga-Gonzalez

References

Sosa, S. (2018). Social Network Analysis, in: Encyclopedia of Animal Cognition and Behavior. Springer.


SebastianSosa/ant documentation built on Sept. 23, 2023, 7:06 a.m.