Abstract
The structure of complex networks is an important aspect in the study of the real network data. Quite often, it is desirable to know the division of the network into communities. A large number of community detection algorithms have been proposed to probe the community structure of complex networks. For a specific partition of a given network, we show that the distribution of modularity under a null hypothesis of free labeling is asymptotically normal when the size of the network gets large. The significance of the partition is defined based on this asymptotic distribution, which can help assess its goodness. Two different partitions can also be compared statistically. Simulation studies and real data analyses are performed for illustration.
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 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.
