Humans as a whole are social animals who live and strive in societies. This communal structure is exhibited in all rungs of society from professional to personal lives. The study of this community structure became prominent when Mark Granovetter’s Ph.D. thesis research surprisingly found that his interviewees learnt about their new job through acquaintances rather than close friends. This led to an increase in the research concerning the structure of society in fields ranging from sociology to computer science. We will start with some of the concepts concerning the community structure, and proceed to cover algorithms that detect communities in networks. Mainly the focus will be on the Girvan-Newman algorithm and the modularity function, and the minimum-cut trees algorithm. We will conclude by looking at the mobile structure network and what the community structure looks like in it.
- 1.Flake, Gary William, Robert E. Tarjan, and Kostas Tsioutsiouliklis. 2002. Clustering methods based on minimum-cut trees. Technical report, technical report 2002–06, NEC, Princeton, NJ.Google Scholar
- 3.Gomory, Ralph E., and Tien Chung Hu. 1961. Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics 9 (4): 551–570.Google Scholar
- 4.Granovetter, Mark S. 1977. The strength of weak ties. In Social networks, 347–367. Elsevier.Google Scholar
- 5.Newman, Mark E.J. 2011. Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E 64 (1): 016132.Google Scholar
- 6.Onnela, J.-P., Jari Saramäki, Jorkki Hyvönen, György Szabó, David Lazer, Kimmo Kaski, János Kertész, and A.-L. Barabási. 2007. Structure and tie strengths in mobile communication networks. Proceedings of the National Academy of Sciences 104 (18): 7332–7336.Google Scholar