Large scale-free networks are not disassortative

Details Large scale-free networks are not disassortative Large scale-free networks are not disassortative

2012-04-01

arxiv.org/abs/1204.0266v1

Physics

Physics and Society

Scientific paper

Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree correlations between neighbouring nodes. In this paper we propose a new way of measuring degree-degree correlations. We show that the commonly used assortativity coefficient significantly underestimates the magnitude of correlations, especially in large disassortative networks. We mathematically explain this phenomenon and validate the results on synthetic graphs and real-world network data. As an alternative, we suggest to use rank correlation measures such as the well-known Spearman's rho. Our experiments convincingly show that Spearman's rho produces consistent values in graphs of different sizes but similar structure, and it is able to reveal strong (positive or negative) correlations in large graphs. In particular, using the Spearman's rho we show that preferential attachment model exhibits significant negative degree-degree correlations. We also discover much stronger negative correlations in Web graphs than was previously thought. We conclude that rank correlations provide a suitable and informative method for uncovering network mixing patterns.

Affiliated with

Also associated with

No associations

Rating

Large scale-free networks are not disassortative 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 Large scale-free networks are not disassortative, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large scale-free networks are not disassortative will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509194