Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks

Simple item page
dc.contributor.authorCui, Yaozu
dc.contributor.authorWang, Xingyuan
dc.contributor.authorEustace, Justine
dc.date.accessioned2020-12-10T06:28:49Z
dc.date.available2020-12-10T06:28:49Z
dc.date.issued2014
dc.descriptionAbstract. Full text article available at https://doi.org/10.1016/j.physa.2014.08.050en_US
dc.description.abstractCommunity structure is a common phenomenon in complex networks, and it has been shown that some communities in complex networks often overlap each other. So in this paper we propose a new algorithm to detect overlapping community structure in complex networks. To identify the overlapping community structure, our algorithm firstly extracts fully connected sub-graphs which are maximal sub-graphs from original networks. Then two maximal sub-graphs having the key pair-vertices can be merged into a new larger sub-graph using some belonging degree functions. Furthermore we extend the modularity function to evaluate the proposed algorithm. In addition, overlapping nodes between communities are founded successfully. Finally we report the comparison between the modularity and the computational complexity of the proposed algorithm with some other existing algorithms. The experimental results show that the proposed algorithm gives satisfactory results.en_US
dc.identifier.citationCui, Y., Wang, X., & Eustace, J. (2014). Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks. Physica A: Statistical Mechanics and its Applications, 416, 198-207.en_US
dc.identifier.urihttp://hdl.handle.net/20.500.12661/2639
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectComplex networksen_US
dc.subjectMaximal sub-graphen_US
dc.subjectBelonging degreeen_US
dc.subjectCommunity structureen_US
dc.subjectOverlapping communityen_US
dc.subjectComputational complexityen_US
dc.subjectCommunityen_US
dc.subjectNetworken_US
dc.titleDetecting community structure via the maximal sub-graphs and belonging degrees in complex networksen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Wang & Eustace.pdf
Size:
5.34 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Journal Articles