A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem

Details A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem

2011-02-27

arxiv.org/abs/1102.5511v1

Physics

Physics and Society

7 pages, no figures. Submitted to Social Networks

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-54084