met.disparity {ANTs}R Documentation

Disparity

Description

Calculates the node metric disparity for all vertices.

Usage

met.disparity(M, df = NULL, dfid = NULL)

Arguments

M

a square adjacency matrix, or a list of square adjacency matrices, or an output of ANT functions stat.ds.grp, stat.df.focal, stat.net.lk.

df

a data frame of same length as the input matrix or a list of data frames if argument M is a list of matrices or an output of ANT functions stat.ds.grp, stat.df.focal, stat.net.lk.

dfid

an integer or a string indicating the column with individual ids in argument df.

Details

Disparity measures the variation of the weight of a node. This metric compares a node's strength with its degree. It informs on the type of edges a node i has, i.e. few strong edges or many weak edges. Disparity of a vertex i is the sum of the squares of the division between the weigthed edge between node i and j and the met.strength of node i

Value

Author(s)

Sebastian Sosa, Ivan Puga-Gonzalez.

References

Barthélemy, M., Barrat, A., Pastor-Satorras, R., & Vespignani, A. (2005). Characterization and modeling of weighted networks. Physica a: Statistical mechanics and its applications, 346(1-2), 34-43.

Whitehead, H. (2009). SOCPROG programs: analysing animal social structures. Behavioral Ecology and Sociobiology, 63(5), 765-778.

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

Examples

met.disparity(sim.m)
head(sim.df)
met.disparity(sim.m,df=sim.df)

[Package ANTs version 0.0.16 Index]