arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.0045math.AP
收藏

有限图上的中曲率、阈值动力学和相域论

Mean curvature, threshold dynamics, and phase field theory on finite graphs

Yves van Gennip, Nestor Guillen, Braxton Osting, Andrea L. Bertozzi

摘要:

在连续介质中,中曲率流、Allen-Cahn(AC)偏微分方程和Merriman-Bence-Osher(MBO)阈值动力学方案之间存在密切联系。这些过程的图形类似物最近看到了流行度的上升,作为NP完全组合问题的松弛,这需要更深入的理论基础的图形过程。本文的目的是介绍这些图形的过程中,他们的连续对应,提供一些背景,证明了第一个结果连接它们,说明这些过程的例子,并确定开放的问题,为今后的研究。我们从图割函数中导出图曲率,图割函数是全变差(周长)的自然图对应物。这种推导和由此产生的曲率定义不同于那些在早期文献中,连续中曲率是简单的离散化,并承担许多相似的连续非局部曲率或非局部的手段制定。这种新的图曲率不仅是相关的图MBO动力学,但也出现在变分制定的离散时间图中曲率流。我们证明估计表明,动态是平凡的MBO和AC的演变,如果参数(时间步长和扩散界面尺度,分别)是足够小(一种现象称为“冻结”或“钉扎”),也是MBO的动态是不平凡的,如果时间步长是足够大的。这些界限是根据图的数量,如图的拉普拉斯算子和图的曲率的频谱。将连续MBO方案的李雅普诺夫泛函应用于图,证明了图MBO方案在有限次迭代中收敛到稳态。最近,在文献中,这种方案的变体已经成为最小化(连续)非局部全变差的方法。

英文摘要:

In the continuum, close connections exist between mean curvature flow, the Allen-Cahn (AC) partial differential equation, and the Merriman-Bence-Osher (MBO) threshold dynamics scheme. Graph analogues of these processes have recently seen a rise in popularity as relaxations of NP-complete combinatorial problems, which demands deeper theoretical underpinnings of the graph processes. The aim of this paper is to introduce these graph processes in the light of their continuum counterparts, provide some background, prove the first results connecting them, illustrate these processes with examples and identify open questions for future study. We derive a graph curvature from the graph cut function, the natural graph counterpart of total variation (perimeter). This derivation and the resulting curvature definition differ from those in earlier literature, where the continuum mean curvature is simply discretized, and bears many similarities to the continuum nonlocal curvature or nonlocal means formulation. This new graph curvature is not only relevant for graph MBO dynamics, but also appears in the variational formulation of a discrete time graph mean curvature flow. We prove estimates showing that the dynamics are trivial for both MBO and AC evolutions if the parameters (the time-step and diffuse interface scale, respectively) are sufficiently small (a phenomenon known as "freezing" or "pinning") and also that the dynamics for MBO are nontrivial if the time step is large enough. These bounds are in terms of graph quantities such as the spectrum of the graph Laplacian and the graph curvature. Adapting a Lyapunov functional for the continuum MBO scheme to graphs, we prove that the graph MBO scheme converges to a stationary state in a finite number of iterations. Variations on this scheme have recently become popular in the literature as ways to minimize (continuum) nonlocal total variation.

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

↑