View source: R/met.disparity.single.R
met.disparity.single | R Documentation |
Calculate for all the vertices the node metric call met.disparity.
met.disparity.single(M, df = NULL, dfid = NULL)
M |
a square adjacency matrix. |
df |
a data frame of same length of the input matrix. |
dfid |
an integer indicating the column of individual ids in argument df |
directed |
if true then calculate the met.disparity directed version i.e. in-met.disparity, out-met.disparity, met.disparity. |
Disparity measures the weight variation of a node. This metric compares a node's strength with its degree. It provides information on the type of edges found in a node i, i.e. few strong edges or many weak edges met.disparity of a vertice i is the summe of the squares of the division between the weigthed edge between node i and j and the met.strength of node i
For the undirected version: Return an integer vector of each vertices met.disparity.
For the undirected version: Return a data frame of three columns: met.disparity,inDisparity,outDisparity.
Sebastian Sosa, Ivan Puga-Gonzalez.
Whitehead, H. A. L. (1997). Analysing animal social structure. Animal behaviour, 53(5), 1053-1067.
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.