Submodular set function

Definition

Submodular function is a set function ${\displaystyle f:2^{\Omega }\rightarrow R}$  such that for any ${\displaystyle X\subseteq Y\subseteq \Omega }$  and ${\displaystyle x\in \Omega \backslash Y}$  we have that ${\displaystyle f(X\cup \{x\})-f(X)\geq f(Y\cup \{x\})-f(Y)}$ 

Examples

1. Graph cuts

   Let ${\displaystyle \Omega =\{v_{1},v_{2},...,v_{n}\}}$  be the vertices of a graph. For any set of vertices ${\displaystyle S\subseteq \Omega }$  let ${\displaystyle f(S)}$  denote the number of edges ${\displaystyle e=(u,v)}$  such that ${\displaystyle u\in S}$  and ${\displaystyle v\in \Omega -S}$ .

2. Coverage function

   Let ${\displaystyle \Omega =\{e_{1},e_{2},...,e_{n}\}}$  be the ground set. Consider a universe ${\displaystyle U}$  and a set of sets ${\displaystyle \{E_{1},E_{2},...,E_{n}\}}$  of the universe ${\displaystyle U}$ . Then a coverage function is defined for any set ${\displaystyle S\subseteq \Omega }$  as ${\displaystyle f(S)=|\cup _{e_{i}\in \Omega }E_{i}|}$ .

3. Entropy

   Let ${\displaystyle \Omega =\{X_{1},X_{2},...,X_{n}\}}$  be a set of random variables. Then for any ${\displaystyle S\subseteq \Omega }$  we have that ${\displaystyle H(S)}$  is a submodular function, where ${\displaystyle H(S)}$  is the entropy of the set of random variables ${\displaystyle S}$ 

4. Mutual information

   Let ${\displaystyle \Omega =\{X_{1},X_{2},...,X_{n}\}}$  be a set of random variables. Then for any ${\displaystyle S\subseteq \Omega }$  we have that ${\displaystyle f(S)=I(S;\Omega -S)}$  is a submodular function, where ${\displaystyle I(S;\Omega -S)}$  is the mutual information.

5. Matroid rank functions

   Let ${\displaystyle \Omega =\{e_{1},e_{2},...,e_{n}\}}$  be the ground set on which a matroid is defined. Then the rank function of the matroid is a submodular function.

Optimization Problems

Submodular functions have properties which are very similar to convex and concave functions. Hence a lot of optimization problems can be cast as maximizing or minimizing submodular functions subject to various constraints.

1. Minimization of Submodular functions.

   Under the simplest case the problem is to find set ${\displaystyle S\subseteq \Omega }$  which minimizes submodular function subject to no constraints. A series of results ^[1][2][3][4] have established the polynomial time solvability of this problem.

2. Maximization of Submodular functions.

   Unlike minimization, maximization of submodular functions is typically NP-Hard. A host of problems such as Max cut,Maximum coverage problem can be cast as special cases of this problem under suitable constraints.

References

• Alexander Schrijver. Combinatorial Optimization, Polyhedra and Efficiency.

1. Grotschel, Lovasz, Schrijver
2. Cunningham
3. Iwata, Fleischer, Fujishige
4. Schrijver

External links