Hierarchical partitions of social networks between rivaling leaders.

ABSTRACT: A model algorithm is proposed to imitate a series of of consecutive conflicts between leaders in social groups. The leaders are represented by local hubs, i.e., nodes with highest node degrees. We simulate subsequent hierarchical partitions of a complex connected network which represents a social structure. The partitions are supposed to appear as actions of members of two conflicted groups surrounding two strongest leaders. According to the model, links at the shortest path between the rival leaders are successively removed. When the group is split into two disjoint parts then each part is further divided as the initial network. The algorithm is stopped, if in all parts a distance from a local leader to any node in his group is shorter than three links. The numerically calculated size dis

SUBMITTER: Krawczyk MJ 

PROVIDER: S-EPMC5863967 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature