Zero Pearson Coefficient for Strongly Correlated Growing Trees

Details Zero Pearson Coefficient for Strongly Correlated Growing Trees Zero Pearson Coefficient for Strongly Correlated Growing Trees

2009-11-22

arxiv.org/abs/0911.4285v1

Phys. Rev. E 81, 031135 (2010)

Physics

Condensed Matter

Statistical Mechanics

6 pages, 4 figures

Scientific paper

We obtained Pearson's coefficient of strongly correlated recursive networks growing by preferential attachment of every new vertex by $m$ edges. We found that the Pearson coefficient is exactly zero in the infinite network limit for the recursive trees ($m=1$). If the number of connections of new vertices exceeds one ($m>1$), then the Pearson coefficient in the infinite networks equals zero only when the degree distribution exponent $\gamma$ does not exceed 4. We calculated the Pearson coefficient for finite networks and observed a slow, power-law like approach to an infinite network limit. Our findings indicate that Pearson's coefficient strongly depends on size and details of networks, which makes this characteristic virtually useless for quantitative comparison of different networks.

Affiliated with

Also associated with

No associations

Rating

Zero Pearson Coefficient for Strongly Correlated Growing Trees 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 Zero Pearson Coefficient for Strongly Correlated Growing Trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero Pearson Coefficient for Strongly Correlated Growing Trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172706