On the Analysis of a Label Propagation Algorithm for Community Detection

DOI10.1007/978-3-642-35668-1_18zbMath1351.68303arXiv1210.3735OpenAlexW1831343635MaRDI QIDQ5507403

Kishore Kothapalli, Vivek B. Sardeshmukh, Sriram V. Pemmaraju

Publication date: 19 December 2016

Published in: Distributed Computing and Networking (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Distributed algorithms (68W15)

Related Items (8)

Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023 ⋮ Step-by-step community detection in volume-regular graphs ⋮ Practical Minimum Cut Algorithms ⋮ The Maximum Label Propagation Algorithm on Sparse Random Graphs ⋮ Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering ⋮ Distributed community detection in dynamic graphs ⋮ Distributed Community Detection in Dynamic Graphs

This page was built for publication: On the Analysis of a Label Propagation Algorithm for Community Detection