July 2016
Beginner to intermediate
462 pages
9h 14m
English
Content preview from Python Data Analysis Cookbook
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Calculating the assortativity coefficient of a graph
In graph theory, similarity is measured by the degree distribution. Degree is the number of connections a node has to other nodes. In a directed graph, we have incoming and outgoing connections and corresponding indegree and outdegree. Friends tend to have something in common. In graph theory, this tendency is measured by the assortativity coefficient. This coefficient is the Pearson correlation coefficient between a pair of nodes, as given in the following equation:
qk (distribution of the remaining degree) is the number of connections leaving node k. ejk is the joint probability distribution ...