In this paper, we introduce two novel evolutionary processes for hierarchical networks referred to as dominance- and prestige-based evolution models, i.e., DBEM and PBEM, respectively. Our models are deterministic in nature which allows for closed-form derivation of equilibrium points for such type of networks, for the special case of complete networks. After deriving these equilibrium points, we are somewhat surprised in recovering the exponential and power-law strength distribution as the shared property of the resulting hierarchal networks. Additionally, we compute the network properties, Geodesic distance distribution and centrality closeness, for each model in closed form. Interestingly, these results demonstrate very different roles of hubs for each model, shedding the light on the evolutionary advantages of hierarchies in social networks: in short, hierarchies can lead to efficient sharing of resources and robustness to random failures. For the general case of any hierarchical network, we compare the estimations of tie intensities and node strengths using the proposed models to open-source real-world data. The prediction results are statistically compared using the Kolmogorov–Smirnov test with the original data.
On the prevalence of hierarchies in social networks
B. R. Sahraei,Haitham Bou-Ammar,K. Tuyls,Gerhard Weiss
Published 2016 in Social Network Analysis and Mining
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
Social Network Analysis and Mining
- Publication date
2016-08-12
- Fields of study
Sociology, Computer Science, Mathematics
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-40 of 40 references · Page 1 of 1
CITED BY
Showing 1-2 of 2 citing papers · Page 1 of 1