Two provably consistent divide-and-conquer clustering algorithms for large networks

In this article, we advance divide-and-conquer strategies for solving the community detection problem in networks. We propose two algorithms that perform clustering on several small subgraphs and finally patch the results into a single clustering. The main advantage of these algorithms is that they...

Full description

Bibliographic Details

Published in:	Proceedings of the National Academy of Sciences - PNAS Vol. 118; no. 44
Main Authors:	Mukherjee, Soumendu Sundar, Sarkar, Purnamrita, Bickel, Peter J
Format:	Journal Article
Language:	English
Published:	United States 02.11.2021
Subjects:	networks clustering divide-and-conquer
ISSN:	1091-6490, 1091-6490
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!