You are here

Simulated Annealing Heuristic For Maximum Correlation Core/periphery Partitioning Of Binary Networks

Title: A Simulated Annealing Heuristic For Maximum Correlation Core/periphery Partitioning Of Binary Networks.
21 views
6 downloads
Name(s): Brusco, Michael, author
Stolze, Hannah J., author
Hoffman, Michaela, author
Steinley, Douglas, author
Type of Resource: text
Genre: Journal Article
Text
Journal Article
Date Issued: 2017-05-09
Physical Form: computer
online resource
Extent: 1 online resource
Language(s): English
Abstract/Description: A popular objective criterion for partitioning a set of actors into core and periphery subsets is the maximization of the correlation between an ideal and observed structure associated with intra-core and intra-periphery ties. The resulting optimization problem has commonly been tackled using heuristic procedures such as relocation algorithms, genetic algorithms, and simulated annealing. In this paper, we present a computationally efficient simulated annealing algorithm for maximum correlation core/periphery partitioning of binary networks. The algorithm is evaluated using simulated networks consisting of up to 2000 actors and spanning a variety of densities for the intra-core, intra-periphery, and inter-core-periphery components of the network. Core/periphery analyses of problem solving, trust, and information sharing networks for the frontline employees and managers of a consumer packaged goods manufacturer are provided to illustrate the use of the model.
Identifier: FSU_libsubv1_wos_000401314000001 (IID), 10.1371/journal.pone.0170448 (DOI)
Keywords: optimization, models
Publication Note: The publisher's version of record is available at https://doi.org/10.1371/journal.pone.0170448
Persistent Link to This Record: http://purl.flvc.org/fsu/fd/FSU_libsubv1_wos_000401314000001
Owner Institution: FSU
Is Part Of: Plos One.
1932-6203
Issue: iss. 5, vol. 12

Choose the citation style.
Brusco, M., Stolze, H. J., Hoffman, M., & Steinley, D. (2017). A Simulated Annealing Heuristic For Maximum Correlation Core/periphery Partitioning Of Binary Networks. Plos One. Retrieved from http://purl.flvc.org/fsu/fd/FSU_libsubv1_wos_000401314000001