IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00633653.html
   My bibliography  Save this paper

Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application

Author

Listed:
  • Vincent Labatut

    (Bit Lab - GSU - Galatasaray University)

  • Jean-Michel Balasque

    (GSU - Galatasaray University)

Abstract

Community detection is an important part of network analysis and has become a very popular field of research. This activity resulted in a profusion of community detection algorithms, all different in some not always clearly defined sense. This makes it very difficult to select an appropriate tool when facing the concrete task of having to identify and interpret groups of nodes, relatively to a system of interest. In this article, we tackle this problem in a very practical way, from the user's point of view. We first review community detection algorithms and characterize them in terms of the nature of the communities they detect. We then focus on the methodological tools one can use to analyze the obtained community structure, both in terms of topological features and nodal attributes. To be as concrete as possible, we use a real-world social network to illustrate the application of the presented tools, and give examples of interpretation of their results from a Business Science perspective.

Suggested Citation

  • Vincent Labatut & Jean-Michel Balasque, 2012. "Detection and Interpretation of Communities in Complex Networks: Methods and Practical Application," Post-Print hal-00633653, HAL.
    • Handle: RePEc:hal:journl:hal-00633653
    DOI: 10.1007/978-1-4471-4048-1_4
    Note: View the original document on HAL open archive server: https://hal.science/hal-00633653v3
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00633653v3/document
    Download Restriction: no
    File URL: https://libkey.io/10.1007/978-1-4471-4048-1_4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gergely Palla & Imre Derényi & Illés Farkas & Tamás Vicsek, 2005. "Uncovering the overlapping community structure of complex networks in nature and society," Nature, Nature, vol. 435(7043), pages 814-818, June.
    2. Rodrigo Aldecoa & Ignacio Marín, 2010. "Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering," PLOS ONE, Public Library of Science, vol. 5(7), pages 1-7, July.
    3. G. Agarwal & D. Kempe, 2008. "Modularity-maximizing graph communities via mathematical programming," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 66(3), pages 409-418, December.
    4. repec:dau:papers:123456789/654 is not listed on IDEAS
    5. Mark S. Handcock & Adrian E. Raftery & Jeremy M. Tantrum, 2007. "Model‐based clustering for social networks," Journal of the Royal Statistical Society Series A, Royal Statistical Society, vol. 170(2), pages 301-354, March.
    6. Lawrence Hubert & Phipps Arabie, 1985. "Comparing partitions," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 193-218, December.
    7. Martin Rosvall & Carl T Bergstrom, 2010. "Mapping Change in Large Networks," PLOS ONE, Public Library of Science, vol. 5(1), pages 1-7, January.
    8. Robert Mokken, 1979. "Cliques, clubs and clans," Quality & Quantity: International Journal of Methodology, Springer, vol. 13(2), pages 161-173, April.
    9. R. Luce, 1950. "Connectivity and generalized cliques in sociometric group structure," Psychometrika, Springer;The Psychometric Society, vol. 15(2), pages 169-190, June.
    10. Duncan J. Watts & Peter Sheridan Dodds, 2007. "Influentials, Networks, and Public Opinion Formation," Journal of Consumer Research, Journal of Consumer Research Inc., vol. 34(4), pages 441-458, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Guang Ouyang & Dipak K. Dey & Panpan Zhang, 2020. "Clique-Based Method for Social Network Clustering," Journal of Classification, Springer;The Classification Society, vol. 37(1), pages 254-274, April.
    2. Vincent Labatut & Jean-Michel Balasque, 2010. "Business-oriented Analysis of a Social Network of University Students," Post-Print hal-00633643, HAL.
    3. Franke, R., 2016. "CHIMERA: Top-down model for hierarchical, overlapping and directed cluster structures in directed and weighted complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 384-408.
    4. Veremyev, Alexander & Boginski, Vladimir, 2012. "Identifying large robust network clusters via new compact formulations of maximum k-club problems," European Journal of Operational Research, Elsevier, vol. 218(2), pages 316-326.
    5. Rawya Zreik & Pierre Latouche & Charles Bouveyron, 2017. "The dynamic random subgraph model for the clustering of evolving networks," Computational Statistics, Springer, vol. 32(2), pages 501-533, June.
    6. Jinyang Dong & Jiamou Liu & Tiezhong Liu, 2021. "The impact of top scientists on the community development of basic research directed by government funding: evidence from program 973 in China," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(10), pages 8561-8579, October.
    7. Luis Lorenzo & Javier Arroyo, 2022. "Analysis of the cryptocurrency market using different prototype-based clustering techniques," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 8(1), pages 1-46, December.
    8. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
    9. Xiang-Sun Zhang & Zhenping Li & Rui-Sheng Wang & Yong Wang, 2012. "A combinatorial model and algorithm for globally searching community structure in complex networks," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 425-442, May.
    10. Yi-Shan Sung & Dashun Wang & Soundar Kumara, 0. "Uncovering the effect of dominant attributes on community topology: A case of facebook networks," Information Systems Frontiers, Springer, vol. 0, pages 1-12.
    11. Foad Mahdavi Pajouh & Balabhaskar Balasundaram & Illya V. Hicks, 2016. "On the 2-Club Polytope of Graphs," Operations Research, INFORMS, vol. 64(6), pages 1466-1481, December.
    12. Nicolo Musmeci & Tomaso Aste & Tiziana Di Matteo, 2014. "Relation between Financial Market Structure and the Real Economy: Comparison between Clustering Methods," Papers 1406.0496, arXiv.org, revised Jan 2015.
    13. Benatti, Alexandre & de Arruda, Henrique Ferraz & Silva, Filipi Nascimento & Comin, César Henrique & da Fontoura Costa, Luciano, 2023. "On the stability of citation networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 610(C).
    14. Teague R. Henry & Kathleen M. Gates & Mitchell J. Prinstein & Douglas Steinley, 2020. "Modeling Heterogeneous Peer Assortment Effects Using Finite Mixture Exponential Random Graph Models," Psychometrika, Springer;The Psychometric Society, vol. 85(1), pages 8-34, March.
    15. Yingda Lu & Kinshuk Jerath & Param Vir Singh, 2013. "The Emergence of Opinion Leaders in a Networked Online Community: A Dyadic Model with Time Dynamics and a Heuristic for Fast Estimation," Management Science, INFORMS, vol. 59(8), pages 1783-1799, August.
    16. Vladimir Boginski & Sergiy Butenko & Oleg Shirokikh & Svyatoslav Trukhanov & Jaime Gil Lafuente, 2014. "A network-based data mining approach to portfolio selection via weighted clique relaxations," Annals of Operations Research, Springer, vol. 216(1), pages 23-34, May.
    17. Michael Braun & André Bonfrer, 2011. "Scalable Inference of Customer Similarities from Interactions Data Using Dirichlet Processes," Marketing Science, INFORMS, vol. 30(3), pages 513-531, 05-06.
    18. Melnykov, Volodymyr, 2016. "ClickClust: An R Package for Model-Based Clustering of Categorical Sequences," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 74(i09).
    19. Xiaoguang Wang & Qikai Cheng & Wei Lu, 2014. "Analyzing evolution of research topics with NEViewer: a new method based on dynamic co-word networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 101(2), pages 1253-1271, November.
    20. Balabhaskar Balasundaram & Sergiy Butenko & Illya V. Hicks, 2011. "Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem," Operations Research, INFORMS, vol. 59(1), pages 133-142, February.

    More about this item

    Keywords

    Complex Networks; Community detection; Business Science; Community interpretation;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-00633653. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.