Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing
Statistics Theory
2019-02-15 v2 Social and Information Networks
Machine Learning
Statistics Theory
Abstract
This paper surveys some recent developments in fundamental limits and optimal algorithms for network analysis. We focus on minimax optimal rates in three fundamental problems of network analysis: graphon estimation, community detection, and hypothesis testing. For each problem, we review state-of-the-art results in the literature followed by general principles behind the optimal procedures that lead to minimax estimation and testing. This allows us to connect problems in network analysis to other statistical inference problems from a general perspective.
Cite
@article{arxiv.1811.06055,
title = {Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing},
author = {Chao Gao and Zongming Ma},
journal= {arXiv preprint arXiv:1811.06055},
year = {2019}
}