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.
Citation
Chao Gao. Zongming Ma. "Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing." Statist. Sci. 36 (1) 16 - 33, February 2021. https://doi.org/10.1214/19-STS736
Information