IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-0754-6_6.html
   My bibliography  Save this book chapter

Defining and Discovering Communities in Social Networks

In: Handbook of Optimization in Complex Networks

Author

Listed:
  • Stephen Kelley

    (Oak Ridge National Laboratory)

  • Mark Goldberg

    (Rensselear Polytechnic Institute)

  • Malik Magdon-Ismail

    (Rensselear Polytechnic Institute)

  • Konstantin Mertsalov

    (Rensselear Polytechnic Institute)

  • Al Wallace

    (Rensselear Polytechnic Institute)

Abstract

The categorization of vertices in a network is a common task across a multitude of domains. Specifically, identifying structural divisions into internally well connected sets have been shown to be useful in computer science, social science, and biology. In each of these areas, grouping vertices using structural boundaries helps one to understand the underlying processes of a network. Identifying such groupings is a non-trivial task and has been a subject of intense research in recent years.

Suggested Citation

  • Stephen Kelley & Mark Goldberg & Malik Magdon-Ismail & Konstantin Mertsalov & Al Wallace, 2012. "Defining and Discovering Communities in Social Networks," Springer Optimization and Its Applications, in: My T. Thai & Panos M. Pardalos (ed.), Handbook of Optimization in Complex Networks, edition 1, chapter 0, pages 139-168, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-0754-6_6
    DOI: 10.1007/978-1-4614-0754-6_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Barberis, Eduardo & Freddi, Daniela & Giammetti, Raffaele & Polidori, Paolo & Teobaldelli, Désirée & Viganò, Elena, 2020. "Trade Relationships in the European Pork Value Chain: A Network Analysis," Economia agro-alimentare / Food Economy, Italian Society of Agri-food Economics/Società Italiana di Economia Agro-Alimentare (SIEA), vol. 22(1), May.
    2. Li, Mingming & Liu, Jing, 2018. "A link clustering based memetic algorithm for overlapping community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 410-423.

    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:spr:spochp:978-1-4614-0754-6_6. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.