Revising the simple measures of assortativity in complex networks

Details Revising the simple measures of assortativity in complex networks Revising the simple measures of assortativity in complex networks

2009-10-18

arxiv.org/abs/0910.3377v1

Physics

Physics and Society

7 pages, 5 figures, accepted by Phys. Rev. E

Scientific paper

We find that traditional statistics for measuring degree mixing are strongly affected by superrich nodes. To counteract and measure the effect of superrich nodes, we propose a paradigm to quantify the mixing pattern of a real network in which different mixing patterns may appear among low-degree nodes and among high-degree nodes. The new paradigm and the simple revised measure uncover the true complex degree mixing patterns of complex networks with superrich nodes. The new method indicates that some networks show a false disassortative mixing induced by superrich nodes, and have no tendency to be genuinely disassortative. Our results also show that the previously observed fragility of scale-free networks is actually greatly exacerbated by the presence of even a very small number of superrich nodes.

Affiliated with

Also associated with

No associations

Rating

Revising the simple measures of assortativity in complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Revising the simple measures of assortativity in complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Revising the simple measures of assortativity in complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-720671