Multicores-periphery structure in networks
arXiv:1605.03286 · doi:10.1016/j.apsusc.2018.09.234
Abstract
Many real-world networks exhibit a multicores-periphery structure, with densely connected vertices in multiple cores surrounded by a general periphery of sparsely connected vertices. Identification of the multicores-periphery structure can provide a new lens to understand the structures and functions of various real-world networks. This paper defines the multicores-periphery structure and introduces an algorithm to identify the optimal partition of multiple cores and the periphery in general networks. We demonstrate the performance of our algorithm by applying it to a well-known social network and a patent technology network, which are best characterized by the multicores-periphery structure. The analyses also reveal the differences between our multicores-periphery detection algorithm and two state-of-the-art algorithms for detecting the single core-periphery structure and community structure.
26 pages
References in corpus (6)
- Fast unfolding of communities in large networks
- Cooperative Game Theory Approaches for Network Partitioning
- The Product Space Conditions the Development of Nations
- Core-periphery organization of complex networks
- Identification of core-periphery structure in networks
- The wisdom of networks: A general adaptation and learning mechanism of complex systems: The network core triggers fast responses to known stimuli; innovations require the slow network periphery and are encoded by core-remodeling