A common variable minimax theorem for graphs

DOI10.1007/S10208-022-09558-8MaRDI QIDQ2697394zbMATH OpenOpenAlexWikidataFDO

Authors Nicholas F. Marshall, Stefan Steinerberger, Ronald R. Coifman

Publication date 12 April 2023

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.14747

zbMATH Keywords

common variable detectiongraph Laplacianspectral graph theory

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) General topics in linear spectral theory for PDEs (35P05) Existence of solutions for minimax problems (49J35)

Recommendations

• Minimax lower bounds for function estimation on graphs
• scientific article; zbMATH DE number 15858
• Publication:3469120
• scientific article; zbMATH DE number 4018944
• scientific article; zbMATH DE number 4133841

Cites work

• Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds
• Concerning nonnegative matrices and doubly stochastic matrices
• Diffusion maps
• Geometric harmonics: a novel tool for multiscale out-of-sample extension of empirical functions
• Learning the geometry of common latent variables using alternating-diffusion
• Limit laws for random matrix products
• Non-orthogonal joint diagonalization in the least-squares sense with application in blind source separation

Cited in

(3)

• A minimum principle for Lagrangian graphs
• Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scaling
• A common variable minimax theorem for graphs

This page was built for publication: A common variable minimax theorem for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697394)