Graphon Estimation
5 papers with code • 0 benchmarks • 1 datasets
Benchmarks
These leaderboards are used to track progress in Graphon Estimation
Netzschleuder
Latest papers with no code
Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation
We show that the mean squared error (MSE) of our estimator converges to $0$ at the rate of $O(d^2 (pn)^{-2/5})$ as long as $\omega(d^5 n)$ random entries from a total of $n^2$ entries of $Y$ are observed (uniformly sampled), $\E[Y]$ has rank $d$, and the entries of $Y$ have bounded support.
Rates of Convergence of Spectral Methods for Graphon Estimation
Recent studies have identified the minimax error rate of estimating the graphon from a single realization of the random graph.
Reducing Crowdsourcing to Graphon Estimation, Statistically
Inferring the correct answers to binary tasks based on multiple noisy answers in an unsupervised manner has emerged as the canonical question for micro-task crowdsourcing or more generally aggregating opinions.
When is Nontrivial Estimation Possible for Graphons and Stochastic Block Models?
We provide a lower bound on the accuracy of estimators for block graphons with a large number of blocks.
An iterative step-function estimator for graphons
Exchangeable graphs arise via a sampling procedure from measurable functions known as graphons.
