2011/02/27 by Sean Z. W. Lip, Lip, Sean Z. W. · 2 citations
Computer Science · Engineering · Physics and Astronomy · #91D30 #Complex Network Analysis Techniques #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #J.4 #Physics and Society (physics.soc-ph) #Social and Information Networks (cs.SI) #Topological and Geometric Data Analysis #VLSI and FPGA Design Techniques #acm:91D30 #cs.DS #cs.SI #msc:91D30 #physics.soc-ph
paper · pdf · doi:10.48550/arxiv.1102.5511
7 pages, no figures. Submitted to Social Networks
arxiv created 2011/02/27 · openalex publication_date 2011/02/27 · arxiv updated 2011/03/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Various methods have been proposed in the literature to determine an optimal partitioning of the set of actors in a network into core and periphery subsets. However, these methods either work only for relatively small input sizes, or do not guarantee an optimal answer. In this paper, we propose a new algorithm to solve this problem. This algorithm is efficient and exact, allowing the optimal partitioning for networks of several thousand actors to be computed in under a second. We also show that the optimal core can be characterized as a set containing the actors with the highest degrees in the original network.