iassortativity {inetwork} | R Documentation |
The function calculates the assortative mixing of each vertex in an undirected, unweighted graph (or network)
iassortativity(A)
A |
a symmetric adjacency matrix with elements zeros or ones representing an undirected and unweighted network |
Assortative mixing knn_i of vertex i sums the degrees of its neighboring vertices. The summation is then normalized to the vertex's degree:
knn_i=(1/k_i)(sum_j A_ij*k_j)
where k_j is the degree of vertex j and A_ij the adjacency matrix of the network. A scatter plot of knn versus k shows if hub (i.e. high-degree) vertices tend to attach to other hub vertices.
knn |
an array holding the assortative mixing of each vertex |
Knnk |
the average knn of the vertices having the same degree k. An increasing Knnk with k indicates that the network is assortative characteristic of social networks. Most nonsocial networks such as technological and biological networks show disassortativity. |
Sun-Chong Wang