Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/233333 
Year of Publication: 
2018
Series/Report no.: 
Discussion paper No. 118
Publisher: 
Aboa Centre for Economics (ACE), 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.
Subjects: 
networks
clustering
community structure
JEL: 
C71
D85
Document Type: 
Working Paper

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.