IDEAS home Printed from https://ideas.repec.org/p/tkk/dpaper/dp118.html
   My bibliography  Save this paper

Recursive Clustering Methods for Network Analysis

Author

Listed:
  • Mitri Kitti

    (University of Turku)

  • Matti Pihlava

    (University of Turku)

  • Hannu Salonen

    (University of Turku)

Abstract

We study axiomatically recursive clustering methods for networks. Such methods can be used to identify community structures of a network. One of the methods is based on identifying a node subset that maximizes the average degree within this subset. Once such a subset is found, the method is applied on the subnetwork whose node set is the complement of the first cluster, and so on recursively. The method produces an ordered partition of the node set of the original network. We give a list of axioms that this method satisfies, and show that any recursive clustering method satisfying the same set of axioms must produce the same or a coarser partition than our method.

Suggested Citation

  • Mitri Kitti & Matti Pihlava & Hannu Salonen, 2018. "Recursive Clustering Methods for Network Analysis," Discussion Papers 118, Aboa Centre for Economics.
    • Handle: RePEc:tkk:dpaper:dp118
    as

    Download full text from publisher

    File URL: http://ace-economics.fi/kuvat/dp118.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    networks; clustering; community structure;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation

    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:tkk:dpaper:dp118. 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: Susmita Baulia (email available below). General contact details of provider: https://edirc.repec.org/data/tukkkfi.html .

    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.