Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pearson's correlation coefficient in the theory of networks: A comment

Published 16 Mar 2018 in cond-mat.dis-nn and cs.SI | (1803.06937v2)

Abstract: In statistics, the Pearson correlation coefficient $r_{x,y}$ determines the degree of linear correlation between two variables and it is known that $-1 \le r_{x,y} \le 1$. In the theory of networks, a curious expression proposed in [PRL {\bf 89} 208701 (2002)] for degree-degree correlation coefficient $r_{j_i,k_i}, i\in [1,M]$ has been in use. We realize that the suggested form is the conventional Pearson's coefficient for ${(j_i,k_i), (k_i,j_i)}$ for $2M$ data points and hence it is rightly dedicated to undirected networks.

Authors (2)
Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.