arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.11535math.APmath.CO
收藏

在无限图上构造热核

Constructing heat kernels on infinite graphs

Jay Jorgenson, Anders Karlsson, Lejla Smajlović

AI总结:

本文将 Minakshisundaram-Pleijel 的 parametrix 方法推广到无限加权图,构造 Laplacian 热核,给出 Taylor 展开、树上显式公式及 Gaussian parametrix 条件。

摘要:

令 $G$ 为一张无限的、具有边权和顶点权并满足某些合理限制的图。我们采用对 Minakshisundaram-Pleijel 在 Riemann 几何情形中提出的 parametrix(拟基本解)方法的一种改编,来构造相应 Laplacian 的热核。这样做的部分动机是希望建立图与子图之间,或一个区域与其离散化之间热核的联系。作为应用,在假设图局部有限的条件下,我们将热核 $H_G(x,y;t)$ 表示为一个 Taylor 级数,其首项为 $a(x,y)t^r$,其中 $r$ 是 $x$ 与 $y$ 之间的组合距离,而 $a(x,y)$(显式地)依赖于边权和顶点权。当 $G$ 是 $q\geq 1$ 的正则 $(q+1)$-树时,我们的构造重新证明了 Chung-Yau 以及 Chinta-Jorgenson-Karlsson 给出的不同显式公式。在组合顶点度一致有界的假设下,我们证明了依赖于 $G$ 上任意具有一致正下界的距离度量的伸缩 Gaussian 可作为我们构造中的 parametrix。我们的工作在一定程度上推广了近期文献 [LNY21, CJKS23],因为所考虑的图是无限且加权的。

英文摘要:

Let $G$ be an infinite, edge- and vertex-weighted graph with certain reasonable restrictions. We construct the heat kernel of the associated Laplacian using an adaptation of the parametrix approach due to Minakshisundaram-Pleijel in the setting of Riemannian geometry. This is partly motivated by the wish to relate the heat kernels of a graph and a subgraph, or of a domain and a discretization of it. As an application, assuming that the graph is locally finite, we express the heat kernel $H_G(x,y;t)$ as a Taylor series with the lead term being $a(x,y)t^r$, where $r$ is the combinatorial distance between $x$ and $y$ and $a(x,y)$ depends (explicitly) upon edge and vertex weights. In the case $G$ is the regular $(q+1)$-tree with $q\geq 1$, our construction reproves different explicit formulas due to Chung-Yau and to Chinta-Jorgenson-Karlsson. Assuming uniform boundedness of the combinatorial vertex degree, we show that a dilated Gaussian depending on any distance metric on $G$, which is uniformly bounded from below can be taken as a parametrix in our construction. Our work extends in part the recent articles [LNY21, CJKS23] in that the graphs are infinite and weighted.

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

↑