Hierarchical partitions of social networks between rivaling leaders.
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 st...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2018-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC5863967?pdf=render |