A spectral method to detect community structure based on the communicability modularity

Ying Xu

Physica A: Statistical Mechanics and its Applications, 2020, vol. 537, issue C

Abstract: Community detection in complex networks is a topic of high interest in many fields. In this paper, we propose a new algorithm based on the communicability of vertices, rather than the most weakly connected vertex pairs or a number of edges between communities. Furthermore, the accuracy and efficiency of this algorithm are tested by some representative real-world networks and computer-generated networks(GN networks). The experimental results indicate that the proposed algorithm can accurately and effectively detect the community structure in these networks with higher values of modularity.

Keywords: Complex networks; Community structure; Communicability; Modularity (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037843711931564X
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:537:y:2020:i:c:s037843711931564x

DOI: 10.1016/j.physa.2019.122751

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().