Graphon estimation via nearest‐neighbour algorithm and two‐dimensional fused‐lasso denoising
From MaRDI portal
Publication:6059433
DOI10.1002/cjs.11676OpenAlexW4200275001MaRDI QIDQ6059433
Oscar-Hernan Madrid-Padilla, Yanzhen Chen
Publication date: 2 November 2023
Published in: Canadian Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cjs.11676
Cites Work
- Rate-optimal graphon estimation
- The solution path of the generalized lasso
- Spectral clustering and the high-dimensional stochastic blockmodel
- Community detection in sparse networks via Grothendieck's inequality
- Locally adaptive regression splines
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Optimal graphon estimation in cut distance
- Matrix estimation by universal singular value thresholding
- Adaptive piecewise polynomial estimation via trend filtering
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- A nonparametric view of network models and Newman–Girvan and other modularities
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- The DFS Fused Lasso: Linear-Time Denoising over General Graphs
- Modular proximal optimization for multidimensional total-variation regularization
- Adaptive nonparametric regression with the K-nearest neighbour fused lasso
- The Traveling Salesman Problem: A Survey
