View source: R/met.assortatvityContinuous.r
met.assortatvityContinuous | R Documentation |
Calculates the binary or weighted version of vertices Newman's assortativity for continuous attributes.
met.assortatvityContinuous(
Matrix,
se = FALSE,
values,
weighted = TRUE,
df = NULL
)
Matrix |
a square adjacency matrix. |
se |
if true, it calculates the standard error. |
values |
The dataframe column that contains the vertices' attributes. |
weighted |
if true, it calculates the weigthed version. |
Assortativity (like the E-I index or the Moran 'I' statistic) allows the study of homophily (preferential interaction between nodes with similar attributes) and heterophily (the preferential interaction between nodes with different attributes). Attributes can be individual characteristics such as sex or age, or individual node metrics such as the met.degree, in which case it is referred to as assortativity by vertex met.degree.
An integer representing the continuous assortativity index of the network.
Ivan Puga-Gonzalez, Sebastian Sosa
Newman, M. E. (2003). Mixing patterns in networks. Physical Review E, 67(2), 026126.
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.