Recognizing number of communities and detecting community structures in complex networks

March 18, 2018 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hongjue Wang, Tao Wang arXiv ID 1803.06591 Category physics.soc-ph Cross-listed cs.SI Citations 1 Venue arXiv.org Last Checked 4 months ago
Abstract
Recognizing number of communities and detecting community structures of complex network are discussed in this paper. As a visual and feasible algorithm, block model has been successfully applied to detect community structures in complex network. In order to measure the quality of the block model, we first define an objective function WQ value. For obtaining block model B of a network, GSA algorithm is applied to optimize WQ with the help of random keys. After executing processes AO (Adding Ones) and RO (Removing Ones) on block model B, the number of communities of a network can be recognized distinctly. Furthermore, based on the advantage of block model that its sort order of nodes is in correspondence with sort order of communities, so a new fuzzy boundary algorithm for detecting community structures is proposed and successfully applied to some representative networks. Finally, experimental results demonstrate the feasibility of the proposed algorithm.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted