{"paper":{"title":"Pearson's correlation coefficient in the theory of networks: A comment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cond-mat.dis-nn","authors_text":"Sachin Kumar, Zafar Ahmed","submitted_at":"2018-03-16T10:14:22Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06937","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}