大图极限下的 Ginzburg–Landau 泛函
Ginzburg--Landau Functionals in the Large-Graph Limit
AI总结:
本文从函数分析视角研究图上 Ginzburg–Landau 泛函的大图极限,证明其 Γ-收敛到 graphon GL 泛函,并用 Young 测度给出概率解释。
摘要:
图上的 Ginzburg–Landau(GL)泛函是图上图割泛函的松弛形式,已在图像分割和图聚类中带来了多种洞见。本文通过将图视为非局部核的函数分析视角,研究 GL 泛函的大图极限。对于具有 $n$ 个节点的图 $W_n$,相应的图 GL 泛函 $\GL^{W_n}_\ep$ 是定义在 $W_n$ 上函数的能量。我们在收敛到称为 graphon 的函数的增长图序列上最小化 GL 泛函。对于这样的图序列,我们证明图 GL 泛函 $Γ$-收敛到一个连续且非局部的泛函,我们称之为 \emph{graphon GL 泛函}。我们还研究了图 GL 和 graphon GL 泛函的锐界面极限,并将这些极限与非局部全变差(TV)泛函联系起来。我们用 Young 测度表示极限 GL 泛函,从而得到大图极限下变分问题的概率解释。最后,为了建立关于 graphon GL 泛函的直观认识,我们确定了几类示例 graphon 族的 GL 极小化子。
英文摘要:
Ginzburg--Landau (GL) functionals on graphs, which are relaxations of graph-cut functionals on graphs, have yielded a variety of insights in image segmentation and graph clustering. In this paper, we study large-graph limits of GL functionals by taking a functional-analytic view of graphs as nonlocal kernels. For a graph $W_n$ with $n$ nodes, the corresponding graph GL functional $\GL^{W_n}_\ep$ is an energy for functions on $W_n$. We minimize GL functionals on sequences of growing graphs that converge to functions called graphons. For such sequences of graphs, we show that the graph GL functional $Γ$-converges to a continuous and nonlocal functional that we call the \emph{graphon GL functional}. We also investigate the sharp-interface limits of the graph GL and graphon GL functionals, and we relate these limits to a nonlocal total-variation (TV) functional. We express the limiting GL functional in terms of Young measures and thereby obtain a probabilistic interpretation of the variational problem in the large-graph limit. Finally, to develop intuition about the graphon GL functional, we determine the GL minimizer for several example families of graphons.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。