Related Experiment Video
Updated: Jul 11, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
A community partitioning algorithm for cyberspace
Kai Qi1, Heng Zhang2, Yang Zhou1
1Institute of Geospatial Information, PLA Strategic Support Force Information Engineering University, Zhengzhou, 450001, Henan, China.
Abstract:
Community partitioning is an effective technique for cyberspace mapping. However, existing community partitioning algorithm only uses the topological structure of the network to divide the community and disregards factors such as real hierarchy, overlap, and directionality of information transmission between communities in cyberspace. Consequently, the traditional community division algorithm is not suitable for dividing cyberspace resources effectively. Based on cyberspace community structure characteristics, this study introduces an algorithm that combines an improved local fitness maximization (LFM) algorithm with the PageRank (PR) algorithm for community partitioning on cyberspace resources, called PR-LFM. First, seed nodes are determined using degree centrality, followed by local community expansion. Nodes belonging to multiple communities undergo further partitioning so that they are retained in the community where they are most important, thus preserving the community's original structure. The experimental data demonstrate good results in the resource division of cyberspace.
Related Concept Videos
Robbers Cave
Distribution and Dispersion
Group Polarization
Separation of Sister Chromatids
At the onset of anaphase, separase, a proteolytic enzyme, is...
Habitat Fragmentation
In- and Out-Groups

