met.outdegree {ANTs}R Documentation

Outdegree

Description

Calculates the node metric met.outdegree for all vertices.

Usage

met.outdegree(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

Outdegree of a node i is the sum of all the outgoing edges of a node i.

Value

Author(s)

Sebastian Sosa, Ivan Puga-Gonzalez.

References

Freeman, L. C. (1978). Centrality in social networks conceptual clarification. Social networks, 1(3), 215-239.

Barrat, A., Barthelemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the United States of America, 101(11), 3747-3752.

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

Examples

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

[Package ANTs version 0.0.16 Index]