met.dge.single: Average Dyadic Efficiency

In SebastianSosa/ant: Animal Network Toolkit Software

Average Dyadic Efficiency

Description

Calculates the average dyadic efficiency of a network.

Usage

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

Arguments

m	a square adjacency matrix.
weighted	if true, 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.

Details

The average dyadic efficiency provides a measure of how efficiently information is exchanged in a network. It can be calculated in binary or weighted networks, undirected or directed networks, normalized or not, and through the strongest or the weakest links. Depending on the problematic, care is needed for the choice of calculation method.

Value

An interger representing the average dyadic efficiency.

Author(s)

Sebastian Sosaez

References

Pasquaretta, C., Levé, M., Claidiere, N., Van De Waal, E., Whiten, A., MacIntosh, A. J., ... & Crofoot, M. C. (2014). Social networks in primates: smart and tolerant species have more efficient networks. Scientific reports, 4, 7600.

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