4.6 Article

Assortative mixing in weighted directed networks

出版社

ELSEVIER
DOI: 10.1016/j.physa.2022.127850

关键词

Assortativity; Network; Graph; Weighted assortativity coefficient; Excess strength

向作者/读者索取更多资源

This paper examines assortative mixing in weighted networks, introduces a generalisation of assortativity concept, provides procedures for assessing and interpreting assortativity, and demonstrates its usefulness in analysing real-world networks.
We analyse assortative mixing, the tendency of vertices to bond with others based on similarities (usually excess vertex degree), in weighted networks, both directed and undirected. We propose a generalisation of the concept of assortativity by introducing our generalised assortativity coefficient. We also provide procedures that allow for both precisely assessing and interpreting the assortativity of weighted networks as well as its statistical significance. Finally, we demonstrate the usefulness of our proposed generalised assortativity coefficient by in-depth analysing the assortativity structure of several weighted real-world networks. (C) 2022 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据