Oracle inequalities for network models and sparse graphon estimation
Olga Klopp (1), Alexandre B. Tsybakov (2), Nicolas Verzelen (3) ((1), MODAL'X, CREST, (2) CREST, (3) MISTEA)

TL;DR
This paper develops oracle inequalities for network models, providing optimal estimation rates for connection probabilities and graphons, especially in sparse networks, and clarifies differences between empirical and integrated loss approaches.
Contribution
It introduces new estimators satisfying oracle inequalities and derives optimal rates for both probability matrix and graphon estimation, including sparse network settings.
Findings
Establishes oracle inequalities for block constant estimators.
Derives optimal estimation rates for sparse networks.
Provides bounds on minimax risks for graphon estimation.
Abstract
Inhomogeneous random graph models encompass many network models such as stochastic block models and latent position models. We consider the problem of statistical estimation of the matrix of connection probabilities based on the observations of the adjacency matrix of the network. Taking the stochastic block model as an approximation, we construct estimators of network connection probabilities -- the ordinary block constant least squares estimator, and its restricted version. We show that they satisfy oracle inequalities with respect to the block constant oracle. As a consequence, we derive optimal rates of estimation of the probability matrix. Our results cover the important setting of sparse networks. Another consequence consists in establishing upper bounds on the minimax risks for graphon estimation in the norm when the probability matrix is sampled according to a graphon…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
