A new metric for assortative and disassortative mixing in networks

The assortative/disassortative mixing is an important index to study the degree correlation among nodes in networks. This paper discussed Newman correlation coefficient r(g) for the assortative/disassortative mixing and pointed out that the metric was unstable about network´s size and dense degree. Besides, a simple and effective assortative/disassortative metric was put forward for networks, and it was named as mixing coefficient 1(g). The result showed that this metric had more advantages than r(g) or improved R(g).