pith. sign in

arxiv: 2407.00355 · v3 · pith:2HC6W3EDnew · submitted 2024-06-29 · ⚛️ physics.soc-ph · cond-mat.stat-mech· cs.SI

Global decomposition of networks into multiple cores formed by local hubs

classification ⚛️ physics.soc-ph cond-mat.stat-mechcs.SI
keywords decompositionmethodstructuresnetworklocallynetworkscore-peripherylocal
0
0 comments X
read the original abstract

Networks are ubiquitous in various fields, representing systems where nodes and their interconnections constitute their intricate structures. We introduce a network decomposition scheme to reveal multiscale core-periphery structures lurking inside, using the concept of locally defined nodal hub centrality and edge-pruning techniques built upon it. We demonstrate that the hub-centrality-based edge pruning reveals a series of breaking points in network decomposition, which effectively separates a network into its backbone and shell structures. Our local-edge decomposition method iteratively identifies and removes locally least connected nodes, and uncovers an onion-like hierarchical structure as a result. Compared with the conventional $k$-core decomposition method, our method based on relative information residing in local structures exhibits a clear advantage in terms of discovering locally crucial substructures. As an application of the method, we present a scheme to detect multiple core-periphery structures and the decomposition of coarse-grained supernode networks, by combining the method with the network community detection.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.