arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.10064math.CAmath.COmath.DGmath.PR
收藏

有限权图中的Bakry-Emery曲率锐度和曲率流。I.理论

Bakry-Émery curvature sharpness and curvature flow in finite weighted graphs. I. Theory

David Cushing, Supanat Kamtue, Shiping Liu, Florentin Münch, Norbert Peyerimhoff, Hugo Benedict Snodgrass

摘要:

在这一系列的两篇论文中,我们介绍了(混合)加权图的曲率流,这是基于Bakry-Émery演算。通过加权方案,通过时间连续的演变来描述流。通过调整该流以保持马尔可夫性质,其极限变成曲率尖锐。我们的目标是在最一般的情况下,不一定可逆的随机游动允许懒惰,包括消失的转移概率沿一些边缘(“退化”边缘)的流动。这种方法需要将所有的概念(特别是Bakry-Émery曲率相关的概念)扩展到这个一般情况,并且它导致了底层拓扑(混合组合图)和加权方案(由转移率给出)之间的区别。我们提出了各种结果的曲率尖点和加权图以及一些基本性质,这种新的曲率流。本文附带了第二篇论文,讨论了Python中的曲率流实现,以供实际使用。在这第二篇论文中,我们提出的例子,并展示进一步的流动性质。

英文摘要:

In this sequence of two papers, we introduce a curvature flow on (mixed) weighted graphs which is based on the Bakry-Émery calculus. The flow is described via a time-continuous evolution through the weighting schemes. By adapting this flow to preserve the Markovian property, its limits turn out to be curvature sharp. Our aim is to present the flow in the most general case of not necessarily reversible random walks allowing laziness, including vanishing transition probabilities along some edges ("degenerate" edges). This approach requires to extend all concepts (in particular, the Bakry-Émery curvature related notions) to this general case and it leads to a distinction between the underlying topology (a mixed combinatorial graph) and the weighting scheme (given by transition rates). We present various results about curvature sharp vertices and weighted graphs as well as some fundamental properties of this new curvature flow. This paper is accompanied by a second paper discussing the curvature flow implementation in Python for practical use. In this second paper we present examples and exhibit further properties of the flow.

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

↑