Network Topology Overlapping Group Detection Based on h-Core Pruning

Abstract

The network group detection has a large number of application researches and has achieved certain results in network security, IP entity location and load balancing. However, due to the large scale of the network topology graph and the large number of terminal nodes, most of the existing overlapping group detection algorithms are relatively complex, and the data size that can be processed is limited, and cannot be directly applied to the network topology. This paper proposes a network topology overlapping group detection algorithm based on h-core pruning. This algorithm decomposes the network into smaller strong connected components, reduces the interference of noisy nodes to overlapping group discovery, and more efficiently detect the largest k-plex group on the target network. A large number of experiments show that the method in this paper is effective. Compared with the full-enum algorithm, our method increases the network size that can be handled by the largest k-plex group by two orders of magnitude, and can detect overlapping groups in the network topology more efficiently.