Node connection strength in Pediatric Surgery Tree.
Each node in Pediatric Surgery 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|
20 most tightly coupled nodes.
Below are the Pediatric Surgery Tree nodes with shortest mean distance.
|1||32.13||Robert E. Gross (Info)||Harvard University||2015-02-10|
|2||38.04||Ronald B. Hirschl (Info)||University of Michigan - CS Mott Children's Hospital||2015-02-10|
|3||40.37||Arnold G. Coran (Info)||University of Michigan - CS Mott Children's Hospital||2015-02-10|
|4||40.99||Peter Mattei (Info)||Children’s Hospital of Philadelphia / University of Pennsylvania||2015-02-10|
|5||43.82||Aviva L. Katz (Info)||Children's Hospital of Pittsburgh||Biomedical Ethics||2015-02-10|
|6||43.82||Philip L. Glick (Info)||State University of New York, Buffalo||CDH, lung development, financial literacy, leadership, shared governance||2015-02-10|
Distribution of individual connectivity.
Another way to look at the Pediatric Surgery 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 71 connections. Thanks to Adam Snyder for suggesting this analysis!
Edge vs node distribution|
|Number of connections|