Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach

Random matrices (algebraic aspects) (15B52) Graph representations (geometric and intersection representations, etc.) (05C62) Matrix completion problems (15A83)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Rate-optimal graphon estimation
An optimal algorithm to recognize Robinsonian dissimilarities
Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
A structural characterization for certifying Robinsonian matrices
Estimation of high-dimensional low-rank matrices
Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
Robust matrix completion
Limits of dense graph sequences
Quick approximation to matrices and applications
NP-hard approximation problems in overlapping clustering.
Optimal rates of statistical seriation
An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Comparisons of several algorithms for Toeplitz matrix recovery
Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
Nonlinear matrix recovery using optimization on the Grassmann manifold
Reconstruction of line-embeddings of graphons
Cut norm discontinuity of triangular truncation of graphons
A noncommutative approach to the graphon Fourier transform
Linear embeddings of graphs and graph limits
Robinsonian matrices: recognition challenges
Noisy low-rank matrix completion with general sampling distribution
Exact matrix completion via convex optimization
Low-Rank Matrix Completion by Riemannian Optimization
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
The Nonlinear Heat Equation on Dense Graphs and Graph Limits
Guaranteed Matrix Completion via Non-Convex Factorization
Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
Reconstruction From Anisotropic Random Measurements
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Rank-Sparsity Incoherence for Matrix Decomposition
Adaptive Thresholding for Sparse Covariance Matrix Estimation
A Spectral Algorithm for Seriation and the Consecutive Ones Problem
Seriation and matrix reordering methods: An historical overview
An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
Matrix Completion From a Few Entries
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Weighted Matrix Completion and Recovery With Prior Subspace Information
An Optimization Parameter for Seriation of Noisy Data
A Simpler Approach to Matrix Completion
Low-rank matrix completion using alternating minimization
Graphon Control of Large-Scale Networks of Linear Systems
Optimal Permutation Recovery in Permuted Monotone Matrix Model
Graph sequences sampled from Robinson graphons
Continuum limits for adaptive network dynamics

This page was built for publication: Robust recovery of Robinson property in \(L^p\)-graphons: a cut-norm approach