Abstract
Communities in networks are the densely knit groups of individuals. Newman suggested modularity - a natural measure of the quality of community partition, and several community detection strategies aiming on maximizing the modularity have been proposed. In this paper, we give a new combinatorial model for modularity maximization problem, and introduce a convex optimization based rounding algorithm. Importantly, even given the maximum number of wanted communities, our solution is still capable of maximizing the modularity and obtaining the upper bound on the best possible solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agarwal, G., Kempe, D.: Modularity-maximizing graph communities via mathematical programming. Eur. Phys. J. B 66(3), 409–418 (2008)
Bi, Y., Weili, W., Zhu, Y., Fan, L., Wang, A.: A nature-inspired influence propagation model for the community expansion problem. J. Comb. Optim. 28(3), 513–528 (2014)
Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)
Lu, Z., Zhu, Y., Li, W., Wu, W., Cheng, X.: Influence-based community partition for social networks. Comput. Soc. Netw. 1(1) (2014)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
Zhang, X.-S., Li, Z., Wang, R.-S., Wang, Y.: A combinatorial model and algorithm for globally searching community structure in complex networks. J. Comb. Optim. 23(4), 425–442 (2012)
Zhu, Y., Li, D., Wen, X., Weili, W., Fan, L., Willson, J.: Mutual-relationship-based community partitioning for social networks. IEEE Trans. Emerg. Top. Comput. 2(4), 436–447 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhu, Y., Sun, C., Li, D., Chen, C., Xu, Y. (2015). Searching Graph Communities by Modularity Maximization via Convex Optimization. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-319-26626-8_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26625-1
Online ISBN: 978-3-319-26626-8
eBook Packages: Computer ScienceComputer Science (R0)