Year: 2026
Type: preprint
Abstract: Modern networks can be huge with millions or even billions of nodes and edges. Thus, algorithms must be capable of scaling to such large networks in order to be practically useful. In this work, we are interested in developing an algorithm to identify core-periphery structure in massive networks. Core-periphery structure is a meso-scale feature where nodes are grouped into a densely connected core or sparsely connected periphery. To identify such structures in large networks, we propose a divide-and-conquer algorithm. The key feature of our algorithm is leveraging the edge list representation of the network, instead of the adjacency matrix, as it tends to be faster and makes a more efficient use of memory. We apply the proposed algorithm to synthetic and real-world data, notably demonstrating its performance on a real-world network with almost 14 million edges without loading the entire network into memory.
Source: arXiv (Cornell University)
Author: Yanchenko, Eric
Institution: Akita International University
Language: English
Subfield: Statistical and Nonlinear Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7206200416