Fig 1.
Simulated annealing (reciprocal cooling) pseudo code.
Table 1.
Attraction rates and computation times for empirical network matrices.
Table 2.
Summary of simulation results.
Fig 2.
The core/periphery partition for the Kansas SAR network obtained using the simulated annealing algorithm.
The naming system for the agencies is from [11, p. 54), and the rows are the ‘sending’ agencies, whereas the columns are the ‘receiving’ agencies. The two boxes contain the intra-core and intra-periphery elements.
Fig 3.
The core/periphery partition for the problem solving network.
The two boxes contain the intra-core and intra-periphery elements.
Fig 4.
The core/periphery partition for the trust network.
The two boxes contain the intra-core and intra-periphery elements.
Fig 5.
The core/periphery partition for the information sharing network.
The two boxes contain the intra-core and intra-periphery elements.