Statistical estimation for optimization problems on graphs

Large graphs abound in machine learning, data mining, and several related areas. A useful step towards analyzing such graphs is that of obtaining certain summary statistics - e.g., or the expected length of a shortest path between two nodes, or the expected weight of a minimum spanning tree of the graph, etc. These statistics provide insight into the structure of a graph, and they can help predict global properties of a graph. Motivated thus, we propose to study statistical properties of structured subgraphs (of a given graph), in particular, to estimate the expected objective function value of a combinatorial optimization problem over these subgraphs. The general task is very difficult, if not unsolvable; so for concreteness we describe a more specific statistical estimation problem based on spanning trees. We hope that our position paper encourages others to also study other types of graphical structures for which one can prove nontrivial statistical estimates.

[1]  Alan M. Frieze,et al.  On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[2]  J. Michael Steele,et al.  Minimal Spanning Trees for Graphs with Random Edge Lengths , 2002 .

[3]  Jeff A. Bilmes,et al.  Approximation Bounds for Inference using Cooperative Cuts , 2011, ICML.

[4]  Fadoua Balabdaoui.  Consistent estimation of a convex density at the origin , 2007 .

[5]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[6]  Jeff A. Bilmes,et al.  Submodularity beyond submodular energies: Coupling edges in graph cuts , 2011, CVPR 2011.

[7]  Andreas Krause,et al.  Efficient Minimization of Decomposable Submodular Functions , 2010, NIPS.

[8]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[9]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[10]  Fabián A. Chudak,et al.  Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization , 2007, SODA '07.

[11]  Gagan Goel,et al.  Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions , 2009, ArXiv.

[12]  Rohana J. Karunamuni,et al.  A semiparametric method of boundary correction for kernel density estimation , 2003 .

[13]  Alan M. Frieze,et al.  A Note on Random Minimum Length Spanning Trees , 2000, Electron. J. Comb..

[14]  Dimitris Bertsimas,et al.  The probabilistic minimum spanning tree problem , 1990, Networks.