Minimax Rates in Network Analysis: Graphon Estimation, Community Detection and Hypothesis Testing

11/14/2018
by   Chao Gao, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/03/2020

A review on minimax rates in change point detection and localisation

This paper reviews recent developments in fundamental limits and optimal...
research
05/05/2020

Bias-Variance Tradeoffs in Joint Spectral Embeddings

Latent position models and their corresponding estimation procedures off...
research
07/20/2021

Limits of Detecting Extraterrestrial Civilizations

The search for extraterrestrial intelligence (SETI) is a scientific ende...
research
10/03/2019

Algebraic statistics, tables, and networks: The Fienberg advantage

Stephen Fienberg's affinity for contingency table problems and reinterpr...
research
08/01/2020

Review on Ranking and Selection: A New Perspective

In this paper, we briefly review the development of ranking-and-selectio...
research
02/05/2019

Optimal Nonparametric Inference via Deep Neural Network

Deep neural network is a state-of-art method in modern science and techn...
research
05/10/2023

An Overview of Asymptotic Normality in Stochastic Blockmodels: Cluster Analysis and Inference

This paper provides a selective review of the statistical network analys...

Please sign up or login with your details

Forgot password? Click here to reset