Figure 3
From: Topological properties and organizing principles of semantic networks

Average nearest neighbor degree (ANND) as a function of degree k and degree correlation coefficient \(\rho _D\) of four English semantic networks. (a) Network ‘Has-A’, (b) Network ‘Is-A’, (c) Network ‘Antonym’, (d) Network ‘Synonym’. See SI for the results of all seven networks. Data points in circles are the average ANND of nodes with degree k in a network, triangles represent the data after logarithmic binning, and squares are the average ANND of nodes with degree k in the rewired network. Logarithmic binning is used to better visualize the data.