Papers › A common variable minimax theorem for graphs
A common variable minimax theorem for graphs
Ronald R. Coifman, Nicholas F. Marshall, Stefan Steinerberger
Let 𝒢 = {G₁ = (V, E₁), …, Gₘ = (V, Eₘ)} be a collection of m graphs defined on a common set of vertices V but with different edge sets E₁, …, Eₘ. Informally, a function f :V →ℝ is smooth with respect to Gₖ = (V,Eₖ) if f(u) ∼f(v) whenever (u, v) ∈Eₖ. We study the problem of understanding whether there exists a nonconstant function that is smooth with respect to all graphs in 𝒢, simultaneously, and how to find it if it exists.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections