Recursive Clustering Methods for Network Analysis

Mitri Kitti, Matti Pihlava and Hannu Salonen
Additional contact information
Mitri Kitti: University of Turku
Matti Pihlava: University of Turku

No 118, Discussion Papers from Aboa Centre for Economics

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.

Keywords: networks; clustering; community structure (search for similar items in EconPapers)
JEL-codes: C71 D85 (search for similar items in EconPapers)
Pages: 16
Date: 2018-10
New Economics Papers: this item is included in nep-gth
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://ace-economics.fi/kuvat/dp118.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tkk:dpaper:dp118

Access Statistics for this paper

More papers in Discussion Papers from Aboa Centre for Economics Contact information at EDIRC.
Bibliographic data for series maintained by Susmita Baulia ().