Local Algorithms for Block Models with Side Information

DOI10.1145/2840728.2840749zbMath1334.68161arXiv1508.02344OpenAlexW2963040507MaRDI QIDQ2800554

Jiaming Xu, Elchanan Mossel

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

random graphscommunity detectionlocal algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Mutual information for the sparse stochastic block model

This page was built for publication: Local Algorithms for Block Models with Side Information