Abstract
One of the most important properties of graphs that represents real complex systems is community structure, or clustering, i.e., organizing vertices in cohesive groups with high concentration of edges within individual groups and low concentration of edges between vertices in different groups. In this paper, we analyze Exponential Quality function for network clustering. We consider different classes of artificial networks from literature and analyze whether the maximization of Exponential Quality function tends to merge or split clusters in optimal partition even if they are unambiguously defined. Our theoretical results show that Exponential Quality function detects the expected and reasonable clusters in all classes of instances and the Modularity function does not.
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.
