赋权图空间上的一个度量
A metric on the space of weighted graphs
摘要：
在本文中，我们提供了一个类似于图编辑距离的度量，它测量两个（可能是无限的）具有有限范数的加权图之间的距离（我们将图的范数定义为其边的绝对值之和）。主要结果是空间的完备性。还研究了该空间的其他一些分析性质。所引入的度量在模式识别和人脸识别方法中有一定的应用。
英文摘要：
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main result is the completeness of the space. Some other analytical properties of this space are also investigated. The introduced metric could have some applications in pattern recognition and face recognition methods.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
