Information Limits for Recovering a Hidden Community

DOI10.1109/TIT.2017.2653804zbMath1372.94364arXiv1509.07859OpenAlexW2577691897MaRDI QIDQ5369834

Jiaming Xu, Yihong Wu, Bruce Hajek

Publication date: 19 October 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Information theory (general) (94A15)

Related Items (9)

Modeling Network Populations via Graph Distances ⋮ Optimal rates for community estimation in the weighted stochastic block model ⋮ A goodness-of-fit test on the number of biclusters in a relational data matrix ⋮ The planted matching problem: sharp threshold and infinite-order phase transition ⋮ Submatrix localization via message passing ⋮ Community Detection and Stochastic Block Models ⋮ Distribution-Free, Size Adaptive Submatrix Detection with Acceleration ⋮ Recovering a hidden community beyond the Kesten–Stigum threshold in O(|E|log^*|V|) time ⋮ Convex optimization for the densest subgraph and densest submatrix problems

This page was built for publication: Information Limits for Recovering a Hidden Community