Massively Parallel Correlation Clustering in Bounded Arboricity Graphs

DOI10.4230/LIPICS.DISC.2021.15MaRDI QIDQ6061704zbMATH OpenOpenAlexFDO

Authors Jara Uitto

Publication date 8 December 2023

Full work available at URL https://arxiv.org/abs/2102.11660

zbMATH Keywords

bounded arboricitycorrelation clusteringMPC algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Abstract: Identifying clusters of similar elements in a set is a common task in data analysis. With the immense growth of data and physical limitations on single processor speed, it is necessary to find efficient parallel algorithms for clustering tasks. In this paper, we study the problem of correlation clustering in bounded arboricity graphs with respect to the Massively Parallel Computation (MPC) model. More specifically, we are given a complete graph where the edges are either positive or negative, indicating whether pairs of vertices are similar or dissimilar. The task is to partition the vertices into clusters with as few disagreements as possible. That is, we want to minimize the number of positive inter-cluster edges and negative intra-cluster edges. Consider an input graph $G$ on $n$ vertices such that the positive edges induce a $lambda$-arboric graph. Our main result is a 3-approximation ($extitinexpectation$) algorithm to correlation clustering that runs in $mathcalO(loglambdacdotextrmpoly(loglogn))$ MPC rounds in the $extitstronglysublinearmemoryregime$. This is obtained by combining structural properties of correlation clustering on bounded arboricity graphs with the insights of Fischer and Noever (SODA '18) on randomized greedy MIS and the $extttPIVOT$ algorithm of Ailon, Charikar, and Newman (STOC '05). Combined with known graph matching algorithms, our structural property also implies an exact algorithm and algorithms with $extitworstcase$ $(1+epsilon)$-approximation guarantees in the special case of forests, where $lambda=1$.

Recommendations

• Correlation clustering in general weighted graphs
• Parallel community detection for massive graphs
• A parallel maximum clique algorithm for large and massive sparse graphs
• Algorithms - ESA 2003
• Improved approximation algorithms for bipartite correlation clustering
• Improved Approximation Algorithms for Bipartite Correlation Clustering

Cited in

(5)

• Algorithms - ESA 2003
• Near-optimal distributed dominating set in bounded arboricity graphs
• Narrowing the \textsf{LOCAL-CONGEST} gaps in sparse networks via expander decompositions
• Min-Max correlation clustering via neighborhood similarity
• Simultaneously approximating all norms for massively parallel correlation clustering

This page was built for publication: Massively Parallel Correlation Clustering in Bounded Arboricity Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6061704)