Rates of Convergence of Spectral Methods for Graphon Estimation

On random graphs, I

P. Erdös and A. Rényi · 1959

Earlier work this paper cites.

A characterization of real analytic functions

H. Komatsu · 1960

Earlier work this paper cites.

Introduction to the theory of linear nonselfadjoint operators in hilbert space

I. G. Y. M. Krein · 1965

Earlier work this paper cites.

Perturbation Theory for Linear Operators

T. Kato · 1966

Earlier work this paper cites.

Piecewise-polynomial approximations of functions of the classes W p α W_{p}^{\alpha}

M. S. Birman and M. Z. Solomyak · 1967

Earlier work this paper cites.

Estimates of singular numbers of integral operators

M. S. Birman and M. Z. Solomyak · 1977

Earlier work this paper cites.

Stochastic blockmodels: First steps

P. W. Holland, K. B. Laskey, and S. Leinhardt · 1983

Earlier work this paper cites.

Eigenvalues of analytic kernels

G. Little and J. Reade · 1984

Earlier work this paper cites.

Asymptotics of spectral projections of some random matrices approximating integral operators

V. I. Koltchinskii · 1998

Earlier work this paper cites.

Random matrix approximation of spectra of integral operators

V. Koltchinskii and E. Giné · 2000

Earlier work this paper cites.

Latent space approaches to social network analysis

P. D. Hoff, A. E. Raftery, and M. S. Handcock · 2002

Earlier work this paper cites.

Spectral techniques applied to sparse random graphs

U. Feige and E. Ofek · 2005

Earlier work this paper cites.

On the convergence of spectral clustering on random samples: the normalized case

U. von Luxburg, O. Bousquet, and M. Belkin · 2005

Earlier work this paper cites.

Limits of dense graph sequences

L. Lovász and B. Szegedy · 2006

Earlier work this paper cites.

Model-based clustering for social networks

M. S. Handcock, A. E. Raftery, and J. M. Tantrum · 2007

Earlier work this paper cites.

Convergent sequences of dense graphs i: Subgraph frequencies, metric properties and testing

C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi · 2008

Earlier work this paper cites.

Introduction to Nonparametric Estimation

A. B. Tsybakov · 2008

Earlier work this paper cites.

High-quality binary protein interaction map of the yeast interactome network

H. Yu, P. Braun, M. A. Yıldırım, I. Lemmens, K. Venkatesan, J. Sahalie, T. Hirozane-Kishikawa, F. Gebreab, N. Li, N. Simonis, et al · 2008

Earlier work this paper cites.

A nonparametric view of network models and newman–girvan and other modularities

P. J. Bickel and A. Chen · 2009

Cited alongside, same era.

A first course in Sobolev spaces

G. Leoni · 2009

Cited alongside, same era.

Nonparametric latent feature models for link prediction

K. Miller, M. I. Jordan, and T. L. Griffiths · 2009

Cited alongside, same era.

Rank penalized estimators for high-dimensional matrices

O. Klopp et al · 2011

Cited alongside, same era.

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

V. Koltchinskii, K. Lounici, A. B. Tsybakov, et al · 2011

Cited alongside, same era.

Convergent sequences of dense graphs ii. multiway cuts and statistical physics

C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós, and K. Vesztergombi · 2012

Cited alongside, same era.

Nonparametric estimation and testing of exchangeable graph models

J. Yang, C. Han, and E. Airoldi · 2014

Later among the works it cites.

Detection in the stochastic block model with multiple clusters: proof of the achievability conjectures, acyclic bp, and the information-computation gap

E. Abbe and C. Sandon · 2015

Later among the works it cites.

Private graphon estimation for sparse graphs

C. Borgs, J. Chayes, and A. Smith · 2015

Later among the works it cites.

Matrix estimation by universal singular value thresholding

S. Chatterjee · 2015

Later among the works it cites.

Rate-optimal graphon estimation

C. Gao, Y. Lu, H. H. Zhou, et al · 2015

Later among the works it cites.

Oracle inequalities for network models and sparse graphon estimation

Original