Rates of Convergence of Spectral Methods for Graphon Estimation

09/10/2017
by   Jiaming Xu, et al.
0

This paper studies the problem of estimating the grahpon model - the underlying generating mechanism of a network. Graphon estimation arises in many applications such as predicting missing links in networks and learning user preferences in recommender systems. The graphon model deals with a random graph of n vertices such that each pair of two vertices i and j are connected independently with probability ρ× f(x_i,x_j), where x_i is the unknown d-dimensional label of vertex i, f is an unknown symmetric function, and ρ is a scaling parameter characterizing the graph sparsity. Recent studies have identified the minimax error rate of estimating the graphon from a single realization of the random graph. However, there exists a wide gap between the known error rates of computationally efficient estimation procedures and the minimax optimal error rate. Here we analyze a spectral method, namely universal singular value thresholding (USVT) algorithm, in the relatively sparse regime with the average vertex degree nρ=Ω( n). When f belongs to Hölder or Sobolev space with smoothness index α, we show the error rate of USVT is at most (nρ)^ -2 α / (2α+d), approaching the minimax optimal error rate (nρ)/(nρ) for d=1 as α increases. Furthermore, when f is analytic, we show the error rate of USVT is at most ^d (nρ)/(nρ). In the special case of stochastic block model with k blocks, the error rate of USVT is at most k/(nρ), which is larger than the minimax optimal error rate by at most a multiplicative factor k/ k. This coincides with the computational gap observed for community detection. A key step of our analysis is to derive the eigenvalue decaying rate of the edge probability matrix using piecewise polynomial approximations of the graphon function f.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2023

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials

Graphon estimation has been one of the most fundamental problems in netw...
research
12/29/2018

Non-Asymptotic Chernoff Lower Bound and Its Application to Community Detection in Stochastic Block Model

Chernoff coefficient is an upper bound of Bayes error probability in cla...
research
06/08/2018

Whether Moving or Not: Modeling and Predicting Error Rates in Pointing Regardless of Target Motion

Understanding the mechanism by which a user's error rate changes in poin...
research
02/13/2018

Analysis of Minimax Error Rate for Crowdsourcing and Its Application to Worker Clustering Model

While crowdsourcing has become an important means to label data, crowdwo...
research
11/26/2021

Optimal Estimation of Schatten Norms of a rectangular Matrix

We consider the twin problems of estimating the effective rank and the S...
research
03/29/2021

The EM Algorithm is Adaptively-Optimal for Unbalanced Symmetric Gaussian Mixtures

This paper studies the problem of estimating the means ±θ_*∈ℝ^d of a sym...
research
05/05/2009

Feasibility of random basis function approximators for modeling and control

We discuss the role of random basis function approximators in modeling a...

Please sign up or login with your details

Forgot password? Click here to reset