Abstract
We propose a simple method to extract the community structure of large networks. Ourmethod is a heuristic method that is based on modularity optimization. It is shown tooutperform all other known community detection methods in terms of computation time.Moreover, the quality of the communities detected is very good, as measured by theso-called modularity. This is shown first by identifying language communities in a Belgianmobile phone network of 2 million customers and by analysing a web graph of 118 millionnodes and more than one billion links. The accuracy of our algorithm is also verified on adhoc modular networks.
Sign-in/Register to access full text options 
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 callMore From: Journal of Statistical Mechanics: Theory and Experiment
Disclaimer: 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.
