arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.0623math.OCcs.DMmath.CO
收藏

凸图不变量

Convex Graph Invariants

Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. Willsky

摘要:

图的结构性质通常用不变量来表征,不变量是不依赖于节点标记的图的函数。本文研究凸图不变量,即图的邻接矩阵的凸函数。一些例子包括图的函数,如最大度、MAXCUT值(及其半定松弛)和谱不变量,如$k$最大特征值之和。这些函数可以用来构造凸集,这些凸集对图施加各种结构约束,从而为通过凸优化解决许多有趣的图问题提供了统一的框架。我们给出了一个表示的所有凸图不变量的某些基本不变量,并描述方法来计算或近似凸图不变量tractably。我们还比较了凸和非凸不变量,并讨论了连接到鲁棒优化。最后,我们使用凸图不变量提供有效的凸规划解决方案的图形问题,如反卷积的两个图形的组合成单独的组件,图形家庭之间的假设检验,并生成具有某些所需的结构特性的图形。

英文摘要:

The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples include functions of a graph such as the maximum degree, the MAXCUT value (and its semidefinite relaxation), and spectral invariants such as the sum of the $k$ largest eigenvalues. Such functions can be used to construct convex sets that impose various structural constraints on graphs, and thus provide a unified framework for solving a number of interesting graph problems via convex optimization. We give a representation of all convex graph invariants in terms of certain elementary invariants, and describe methods to compute or approximate convex graph invariants tractably. We also compare convex and non-convex invariants, and discuss connections to robust optimization. Finally we use convex graph invariants to provide efficient convex programming solutions to graph problems such as the deconvolution of the composition of two graphs into the individual components, hypothesis testing between graph families, and the generation of graphs with certain desired structural properties.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑