步行距离的拓扑解释
A topological interpretation of the walk distances
摘要:
图中的行走距离没有行走权重的直接解释,因为它们是通过行走权重的\emph{logarithms}引入的。只有在有限的情况下,在这些条件消失的情况下,这样的表述才是直截了当的。本文提出的解释依赖于应用于矩阵$I-tA,$的余因子的恒等式$\ln\det B=\tr\ln B$,其中$A$是加权多重图的加权邻接矩阵,$t$是一个充分小的正参数。此外,这种解释是基于矩阵对数的幂级数展开。Kasteleyn(1967)可能是第一个应用上述方法扩展$I-A$行列式的人。我们表明,使用一定的线性变换,同样的方法可以扩展到$I-tA,$的余因子,它提供了一个拓扑解释的步行距离。
英文摘要:
The walk distances in graphs have no direct interpretation in terms of walk weights, since they are introduced via the \emph{logarithms} of walk weights. Only in the limiting cases where the logarithms vanish such representations follow straightforwardly. The interpretation proposed in this paper rests on the identity $\ln\det B=\tr\ln B$ applied to the cofactors of the matrix $I-tA,$ where $A$ is the weighted adjacency matrix of a weighted multigraph and $t$ is a sufficiently small positive parameter. In addition, this interpretation is based on the power series expansion of the logarithm of a matrix. Kasteleyn (1967) was probably the first to apply the foregoing approach to expanding the determinant of $I-A$. We show that using a certain linear transformation the same approach can be extended to the cofactors of $I-tA,$ which provides a topological interpretation of the walk distances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。