图上层的流切对偶
Flow-Cut Dualities for Sheaves on Graphs
摘要:
本文将最大流最小割定理从数值容度的设定推广到有向图上半环上部分半模的层。部分半模的例子包括概率分布、多商品容量约束和逻辑命题。这种层的有向(共)同调论描述了网络上的类似结构。首先,同调对局部可分解流进行分类,半环上的方向层概括方向,同调连接映射为流赋值,上同调连接映射为割赋值,庞加莱对偶将流的分解描述为割上的局部流。随后的解释可行的流值作为同伦限制推广MFMC的边缘权重在某些有序monoid [Frieze],因此也是经典的MFMC。某些对偶差距被解释为失败的定向层(上)的同源性,以满足一个自然的概括的准确性。
英文摘要:
This paper generalizes the Max-Flow Min-Cut (MFMC) theorem from the setting of numerical capacities to sheaves of partial semimodules over semirings on directed graphs. Motivating examples of partial semimodules include probability distributions, multicommodity capacity constraints, and logical propositions. Directed (co)homology theories for such sheaves describes familar constructs on networks. First homology classifies locally decomposable flows, an orientation sheaf over a semiring generalizes directions, connecting maps for homology assign values to flows, connecting maps for cohomology assign values to cuts, and a Poincare Duality describes a decomposition of flows as local flows over cuts. A consequent interpretation of feasible flow-values as a homotopy limit generalizes MFMC for edge weights in certain ordered monoids [Frieze] and hence also classical MFMC. Certain duality gaps are explained as a failure for directed sheaf (co)homology to satisfy a natural generalization of exactness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。