Community detection based on network communicability distance

Ying Xu

Physica A: Statistical Mechanics and its Applications, 2019, vol. 515, issue C, 112-118

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 communicability distance for community detection in network(CD algorithm). 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 CD algorithm can accurately and effectively detect the community structure in these networks with higher values of modularity.

Keywords: complex networks; Community structure; Modularity; Communicability distance (search for similar items in EconPapers)
Date: 2019
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/S0378437118313232
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:515:y:2019:i:c:p:112-118

DOI: 10.1016/j.physa.2018.09.191

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 ().