Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing
arXiv:1811.06055
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.
References in corpus (10)
- Stochastic blockmodels and community structure in networks
- Consistency of spectral clustering
- Graph limits and exchangeable random graphs
- Accurate Community Detection in the Stochastic Block Model via Spectral Algorithms
- Testing for Global Network Structure Using Small Subgraph Statistics
- Optimal hypothesis testing for stochastic block models with growing degrees
- Analysis of spectral clustering algorithms for community detection: the general bipartite setting
- Exploration of Large Networks with Covariates via Fast and Universal Latent Space Model Fitting
- Phase Transitions in Approximate Ranking
- Network Global Testing by Counting Graphlets