Abstract
Community structure is a common property of many networks. Automatically finding communities in networks can provide invaluable help in understanding the structure and the functionality of networks. Many algorithms to find communities have been developed in recent years. Here we devise a new algorithm to detect communities in networks—propagation algorithm. By propagating the labels of nodes in networks, detecting communities are transformed into analyzing the labels of nodes in networks in this algorithm. Real-world and computer-generated networks are used to verify this algorithm. The results of our experiments indicate that it is sensitive to community structure and effective at discovering communities in networks.KeywordsComplex networksCommunity structurePropagation algorithm
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
