论文标题
时间探索路径的模量
Modulus of time-respecting paths
论文作者
论文摘要
在静态图上，一系列路径家族的p模子既反映了这些路径的长度及其多样性。与几个长期重叠路径的家族相比，许多短暂的，不相交的路径的家庭具有更大的模量。在这项工作中，我们为时间图上的时间探索路径定义了P-Modulus版本。该公式利用时间惩罚功能作为打折路径的一种手段，这些路径需要相对较长的时间才能穿越，从而使模量也可以捕获有关家庭的时间信息。通过转换，我们表明，这种时间p-sodulus可以被认为是静态图上的p-模子问题，因此，可以将对象家族的p-modulus的许多已知理论转化为时间路径的情况。我们在示例中演示了时间模量的某些特性。
On a static graph, the p-modulus of a family of paths reflects both the lengths of these paths as well as their diversity; a family of many short, disjoint paths has larger modulus than a family of a few long overlapping paths. In this work, we define a version of p-modulus for time-respecting paths on temporal graphs. This formulation makes use of a time penalty function as a means of discounting paths that take a relatively long time to traverse, thus allowing modulus to capture temporal information about the family as well. By means of a transformation, we show that this temporal p-modulus can be recognized as a p-modulus problem on a static graph and, therefore, that much of the known theory of p-modulus of families of objects can be translated to the case of temporal paths. We demonstrate some properties of temporal modulus on examples.
