Abstract
The paper presents an investigation method of social networks based on language games. This method is used for finding implicit communities and influential agents in social networks. The authors introduce a naming game and explain how it is applied in investigation of social networks. Simulation results are demonstrated for specially designed graphs and a real-data graph. The authors also survey alternative methods of community detection and compare them with the above-mentioned method.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wittgenstein, L, Philosophische Untersuchungen, Oxford: Blackwell, 1953. Translated under the title Filosofskie issledovaniya, Moscow: AST, 2011.
Mikulich, L.I. and Naumkina, T.S., Use of Lingual Games for Simulation of Language Appearance in Multiagent Systems, 13 Natl. Conf. “Artificial Intelligence-2012”, Belgorod: Bel. Gos. Tekhn. Univ., 2012, vol. 3, pp. 34–39.
Mikulich, L.I. and Naumkina, T.S., Use of Lingual Games in Multiagent Systems, Materialy konf. “Upravlenie v tekhnicheskikh, ergaticheskikh, organizatsionnykh i setevykh sistemakh (UTEOSS-2012)” (Proc. Conf. “Control in Technical, Ergatic, Organizational and Network Systems”), St. Petersburg: JSC Concern CSRI Electropribor, 2012, pp. 1188–1191.
Baronchelli, A., Dall’Asta, L., and Barrat, A., The Role of Topology on the Dynamics of the Naming Game, Eur. Phys. J.: Special Topics, 2007, no. 143(1), pp. 233–235.
Blondel, V.D., Guillaume, J.-L., Lambiotte, R., et al., Fast Unfolding of Communities in Large Networks, J. Statist. Mech.: Theory Experim., 2008, p. 10008.
Cattuto, C., Loreto, V., and Pietronero, L., Semiotic Dynamics and Collaborative Tagging, Proc. Natl. Acad. Sci. USA, 2007, vol. 104, pp. 1461–1464.
Clauset, A., Newman, M., and Moore, C., Finding Community Structure in Very Large Networks, Phys. Rev. E, 2004, no. 70, 066111.
Dhillon, I.S., Guan, Y., and Kulis, B., Weighted Graph Cuts without Eigenvectors: A Multilevel Approach, IEEE Trans. Pattern Anal. Machine Intel., 2007, no. 29(11), pp. 1944–1957.
Gosti, G. and Batchelder, W.H., Naming on a Directed Graph, in Social Computing, Behavioral-Cultural Modeling, 2011, pp. 358–365.
Ke, J., Minett, J.W.J., Au, C.-P.C., et al., Self-Organization and Selection in the Emergence of Vocabulary, Complexity, 2002, no. 7, pp. 1–28.
Kernigan, B. and Lin, S., An Efficient Heuristic Procedure for Partitioning Graphs, Bell Syst. Tech. J., 1970, no. 49, pp. 291–307.
Lancichinetti, A. and Fortunato, S., Benchmarks for Testing Community Detection Algorithms on Directed and Weighted Graphs with Overlapping Communities, Phys. Rev., 2009, no. E80, 016118.
Lancichinetti, A., Fortunato, S., and Kertész, J., Detecting the Overlapping and Hierarchical Community Structure in Complex Networks, New J. Phys., 2009, no. 11(3), 033015.
Lu, Q., Korniss, G., Szymanski, B.K., The Naming Game in Social Networks: Community Formation and Consensus Engineering, J. Econom. Interact. Coordination, 2009, no. 4, pp. 221–235.
Newman, M.E.J., Finding Community Structure in Networks Using the Eigenvectors of Matrices, Phys. Rev., 2006, no. E70, 036104.
Newman, M. and Girvan, M., Finding and Evaluating Community Structure in Networks, Phys. Rev., 2004. no. E69, 026113.
Pons, P. and Latapy, M., Computing Communities in Large Networks Using RandomWalks, in Comput. Inform. Sci.–ISCIS 2005, Berlin: Springer, 2005, pp. 284–293.
Raghavan, U., Albert, R. and Kumara, S., Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks, Phys. Rev., 2007, no. E76, 036106.
Reichardt, J. and Bornholdt, S., Statistical Mechanics of Community Detection, Phys. Rev., 2006, no. E74, 016110.
Rosvall, M. and Bergstrom, C.T., Maps of Random Walks on Complex Networks Reveal Community Structure, Proc. Natl. Acad. Sci. USA, 2008, vol. 105, pp. 1118–1123.
Schulz, R., Glover, A., and Milford, M., Lingodroids: Studies in Spatial Cognition and Language, in ICRA 2011, IEEE Int. Conf., pp. 178–183.
Steels, L., Language Games for Autonomous Robots, IEEE Intel. Syst., 2001, pp. 16–22.
Steels, L., Self-Organizing Vocabularies, Proc. 5th Int. Workshop on Artificial Life: Synthesis and Simulation of Living Systems, ALIFE-96, 1997, pp. 179–184.
Steels, L. and Mcintyre, A., Spatially Distributed Naming Games, Adv. Complex Syst., 1999, no. 1, pp. 301–323.
Shi, J. and Malik, J., Normalized Cuts and Image Segmentation, IEEE Trans. Pattern Anal. Machine Intel., 2001, no. 22(8), pp. 888–905.
Van Dongen, S., Graph Clustering by Flow Stimulation, PhD Thesis, Univ. of Utrecht, 2000.
Author information
Authors and Affiliations
Additional information
Original Russian Text © D.A. Gubanov, L.I. Mikulich, T.S. Naumkina, 2014, published in Upravlenie Bol’shimi Sistemami, 2014, No. 51, pp. 82–106.
Rights and permissions
About this article
Cite this article
Gubanov, D.A., Mikulich, L.I. & Naumkina, T.S. Language games in investigation of social networks: Finding communities and influential agents. Autom Remote Control 77, 144–158 (2016). https://doi.org/10.1134/S0005117916010094
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117916010094