Open Access
February 2021 Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing
Chao Gao, Zongming Ma
Statist. Sci. 36(1): 16-33 (February 2021). DOI: 10.1214/19-STS736

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

Download 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

Published: February 2021
First available in Project Euclid: 21 December 2020

MathSciNet: MR4194201
Digital Object Identifier: 10.1214/19-STS736

Keywords: clustering , Minimax rates , polynomial-time algorithms , Random graphs , social networks

Rights: Copyright © 2021 Institute of Mathematical Statistics

Vol.36 • No. 1 • February 2021
Back to Top