Assortativity measures for weighted and directed networks
arXiv:2101.05389
Abstract
Assortativity measures the tendency of a vertex in a network being connected by other vertexes with respect to some vertex-specific features. Classical assortativity coefficients are defined for unweighted and undirected networks with respect to vertex degree. We propose a class of assortativity coefficients that capture the assortative characteristics and structure of weighted and directed networks more precisely. The vertex-to-vertex strength correlation is used as an example, but the proposed measure can be applied to any pair of vertex-specific features. The effectiveness of the proposed measure is assessed through extensive simulations based on prevalent random network models in comparison with existing assortativity measures. In application World Input-Ouput Networks,the new measures reveal interesting insights that would not be obtained by using existing ones. An implementation is publicly available in a R package "wdnet".
References in corpus (14)
- Emergence of scaling in random networks
- Assortative mixing in networks
- The architecture of complex weighted networks
- Mixing patterns in networks
- Extracting the multiscale backbone of complex weighted networks
- Edge direction and the structure of networks
- World Input-Output Network
- Weighted Assortative And Disassortative Networks Model
- Assortative model for social networks
- Uncovering disassortativity in large scale-free networks
- Degree-degree correlations in random graphs with heavy-tailed degrees
- Complex earthquake networks: Hierarchical organization and assortative mixing
- Higher order assortativity in complex networks
- Measuring degree-degree association in networks