Social networks are generally represented as graphs (nodes represent users and edges represent their associations). Community in a social network means group of people which are more closely connected to each other as compared to their connection with rest of the people in the network. Clique in a graph is a subgraph such that each node in the subgraph is connected to every other node of this subgraph (complete subgraph). In this way clique is strict version of community. Community detection in social networks has attracted researchers effectively due to its wide range of applications. Cliques, having similar characteristics, prove to be highly applicable in community detection process. There are several community detection techniques in the literature which are developed around cliques. Generally these techniques fall into category of clique percolation methods. Clique percolation is a prominent approach that is based on k-cliques in the graph. This paper represents a detailed discussion of significant k-clique based techniques existing in community detection literature.

Social Graph; Clique, Community Detection, Social Network Analysis

[1] M.E.J. Newman and M. Girvan,“Finding and Evaluating Community Structure in Networks.”, Physical Revew, E69(026113),2004.
[2] J. Chen, H. Zhang, Z. H. Guan, T. Li, "Epidemic spreading on networks with overlapping community structure," Physica A: Statistical Mechanics and its Applications, 2011.
[3] Atul Srivastava, Anuradha and Dimple Juneja Gupta, “Social Network Analysis: Hardly Easy”, IEEE International Conference on Reliability, Optimization and Information Technology, pg. 128-135, 6, February 2014.
[4] S. Fortunato. “Community Detection in Graphs.” Physics Reports 486:3 (2010), 75–174.
[5] G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. “Uncovering the Overlapping Community Structure of Complex Networks in Nature and Society.” Nature 435, pp. 814–818, 2005.
[6] S. Sadi, S. Oguducu, and A. S. Uyar. “An Efficient Community Detection Method Using Paralle Clique Finding Ants.” In Proceedings of the IEEE Congress on Evolutionary Computation, pp.1–7. IEEE, 2010.
[7] J. G. Augustson and J. Minker. “An Analysis of Some Graph Theoretical Cluster Techniques.” Journal of the ACM 17:4, 571–588, 1970.
[8] M. Pavan and M. Pelillo. “A New Graph-Theoretic Approach to Clustering and Segmentation.” In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR’03), pp. 145–152. Washington, DC, USA: IEEE Computer Society, 2003.
[9] Mansoureh Takaffoli, Farzad Sangi, Justin Fagnan and Osmar R. Zaiane, “A Framework For analyzing Dynamic Social Networks”, In 7th conference on Applications of Social Network Analysis ASNA’10, 2010.
[10] Jure Leskovec, Jon Kleinberg, and Christos Faloutsos, “Graphs Over Time: Desnsification Laws, Shrinking Diameters and Possible Explanations.” In KDD ’05: Proceedingsof the 11th ACM SIGKDD international conference on Knowledge discovery in data mining, pages 177-187, 2005.
[11] Lars Backstrom, Dan Huttenlocher, Jon Kleinberg and Xiangyang Lan, “Group Formation in large social networks: membership, growth, and evolution.”, In KDD’06 : proceedings of the 12th ACM SIGKDD international conference on Knowledge Discovery in Data mining, pages 44-54, 2006.
[12] Sitaram Asur, Srinivasan Parthasarathy, and Duygu Ucar, “An event-based framework for characterizing the evolutionary behaviour of interaction graphs.”, In KDD ’07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge Discovery in Data mining, pages 913-921, 2007
[13]Tanja Falkowski, Anja Barth and Myra Spiliopoulou, “Studying Community Dynamics with an Incremental graph mining algorithm.”,In Proceedings of the 14th Americas Conference on Information Systems(AMCIS), 2008.
[14] Imre Derenyi, Gergely Palla, and Tamas Vicsek, Clique percolation in random networks, PRL 94, 160202, April 2005.
[15] Jussi M. Kumpula, Mikko Kivela, Kimmo Kaski, and Jari Saramaki, A sequential algorithm for fast clique percolation, arXiv:0805.1449v2 [physics.soc-ph], July 2008.
[16] Shi Xiaohong, Liang Luo, Wan Yan, Xu Jin, A finding maximal clique algorithm for predicting loop of protein structure, Applied Mathematics and Computation 180, 676–682, January 2006.
[17] Sumana Maity and Santanu Kumar Rath, Extended Clique Percolation Method to Detect Overlapping Community Structure, International Conference on Advances in Computing,Communications and Informatics (ICACCI), 31-37, 2014.
[18] Ali Varamesh, Mohammad Kazem Akbari, Mehdi Fereiduni, Saeed Sharifian, Alireza Bagheri, “Distributed Clique Percolation based Community Detection on Social Networks using MapReduce” , In 5th Conference on Information and Knowledge Technology (IKT) , IEEE 978-1-4673-6490-4/13 , pages 478- 483, 2013.
[19] Chen Jing ,FU Cai, Zhang Kang, Fang Zhicun,and Han Lansheng, “K-clique Community Detection based on Union-Find.”, IEEE 978-1-4799-4383-8/14 , 2014.
[20] Fei Hao, Geyong Min, Zheng Pei, Doo-Soon Park, Member, IEEE, and Laurence T. Yang, “K-Clique Community Detection in Social Networks Based on Formal Concept Analysis.”, IEEE SYSTEMS JOURNAL 1932-8184, 2015.
[21] Shuai Wang, Chao Li, and Daquan Tang, “Service Identifying Based Weapon Systems Architecture Optimization with K-Clique Community Detection Algorithm”, In IEEE 3rd International Conference on Control Science and Systems Engineering , IEEE 978-1-5386-0484-7, pp. 656 – 660 ,2017.
[22] Noha Alduaiji , Amitava Datta , and Jianxin Li, “Influence Propagation Model for Clique-Based Community Detection in Social Networks”, In IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS , IEEE 2329-924X , pp. 1-13, 2018.