A common variable minimax theorem for graphs

Code

• github.com/sarihl/common-variable-multi-graph
  pytorch★ 6

Abstract

Let G = _1 = (V, E_1), , G_m = (V, E_m)\ be a collection of m graphs defined on a common set of vertices V but with different edge sets E_1, , E_m. Informally, a function f :V R is smooth with respect to G_k = (V,E_k) if f(u) f(v) whenever (u, v) E_k. We study the problem of understanding whether there exists a nonconstant function that is smooth with respect to all graphs in G, simultaneously, and how to find it if it exists.

Reproductions