Abstract
In order to analyze social networks, a improved method for Clique Percolation Method (CPM) is proposed. Using this method, which is called pseudo Alternative CPM (ACPM), network analysis of friendship networks on SNS sites for college students is carried out. As the number of lack of nodes to fuse two cliques increases, it is confirmed that small communities inside large communities can be detected. The differences between two SNS sites coming from their system, registration or invitation, are also clarified. Moreover the change of average degrees of nodes there is observed and its behavior is also discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)
Milgram, S.: The small world problem. Psych. Today 1, 61–67 (1967)
Travers, T., Milgram, S.: An experimental study of the small world problem. Sociometry 32, 425–443 (1969)
Korte, C., Milgram, S.: Acquaintance links between White and Negro populations: application of the small world method. J. Pers. Soc. Psychol. 15(2), 101–108 (1970)
Yuta, K., Ono, N., Fujiwara, Y.: Structural analysis of human network in social networking services. IPSJ J. 47(3), 865–874 (2006)
Toriumi, F., Yamamoto, H., Suwa, H., Okada, I., Izumi, K., Hashimoto, Y.: Comparison analysis among large amount of SNS sites. Trans. Jpn. Soc. Artif. Intell. 25(1), 78–89 (2010)
Toriumi, F., Ishii, K.: Simulation of encouragement methods for SNS based on user behavior model. In: Proceedings of 3rd World Congress on Social Simulation (2010)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99(12), 7821–7826 (2002)
Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066133 (2004)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping modular structure of protein interaction networks. FEBS J. 272(Suppl. 1), 434–434 (2005)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Tanaka, A.: Proposal of alleviative method of community analysis with overlapping nodes. In: Proceedings of the Seventh IEEE International Conference on Social Computing and Networking, C.1.30-5 (2014)
Tanaka, A., Tomochi, M.: Emergence of hierarchical small-world property in SNS for college students. In: Proceedings of the International Symposium on Nonlinear Theory and Its Application, pp. 98–101 (2012)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Info. Process. Let. 31(1), 7–15 (1989)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Barabási, A.L., Albert, R.: Emergence of scaling networks. Science 286, 509–512 (1999)
Klemm, K., Eguíluz, V.M.: Growing scale-free networks with small-world behavior. Phys. Rev. E 65, 057102 (2002)
Vázquez, A.: Growing networks with local rules. Phys. Rev. E 67, 056104 (2003)
Hayashi, Y.: Asymptotic behavior of the node degrees in the ensemble average of adjacency matrix (2015). arXiv:1512.00553
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Tanaka, A. (2016). Analysis of Social Networks Using Pseudo Cliques and Averaging. In: Fujita, H., Ali, M., Selamat, A., Sasaki, J., Kurematsu, M. (eds) Trends in Applied Knowledge-Based Systems and Data Science. IEA/AIE 2016. Lecture Notes in Computer Science(), vol 9799. Springer, Cham. https://doi.org/10.1007/978-3-319-42007-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-42007-3_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42006-6
Online ISBN: 978-3-319-42007-3
eBook Packages: Computer ScienceComputer Science (R0)