Node connection strength in Computational Biology Tree.
Each node in Computational Biology Tree can be characterized by its mean distance from every other node. Below is a histogram of mean distances for every node in the tree. The final bin includes nodes that are not connected to the main tree. Note also that only individuals whose primary affiliation is this tree are included. Nodes cross-listed from other academic trees are included on their primary tree.

Mean inter-node distance

1-
1-
1-
0-
0-

10 11 12 13 14 15 16 17 18 19+
Mean distance
 Number of nodes 



20 most tightly coupled nodes.
Below are the Computational Biology Tree nodes with shortest mean distance.

Rank Mean dist Name Institution Area Date
1 10.34 Arthur Kornberg (Info) Stanford University DNA replication 2006-10-24
2 15.6 Adam A. Margolin (Info) Oregon Health and Science University Cancer, Gene regulatory models, Computational Biology 2015-10-24
3 19.98 Arthur Clifton Guyton (Info) University of Mississippi Medical Center Neuroscience, Anatomy, and Physiology 2009-11-09


Distribution of individual connectivity.
Another way to look at the Computational Biology Tree graph is to plot a histogram of researchers (nodes) based according to the number of immediate connections (edges) they have to other researchers. The final bin includes nodes with 16 or more connections. The actual distribution has a very long tail, with a maximum of 83 connections. Thanks to Adam Snyder for suggesting this analysis!

Edge vs node distribution

1520-
1216-
912-
608-
304-

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16+
Number of connections
 Node count