Node connection strength in Law Tree.
Each node in Law 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 |
| 0- |
| 0- |
| 0- |
| 0- |
| 0- |
|
|
| Mean distance |
20 most tightly coupled nodes.
Below are the Law Tree nodes with shortest mean distance.
| Rank | Mean dist | Name | Institution | Area | Date |
Distribution of individual connectivity.
Another way to look at the Law 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 18 connections. Thanks to Adam Snyder for suggesting this analysis!
|
Edge vs node distribution | ||||||||||||||||
| 180- |
 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 144- | ||||||||||||||||
| 108- | ||||||||||||||||
| 72- | ||||||||||||||||
| 36- | ||||||||||||||||
|
| ||||||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16+ | |
| Number of connections | ||||||||||||||||
|
Node count | ||||||||||||||||