A metric on the space of weighted graphs
Metric Geometry
2009-06-16 v1
Abstract
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.
Cite
@article{arxiv.0906.2558,
title = {A metric on the space of weighted graphs},
author = {Hamed Daneshpajouh and Hamid Reza Daneshpajouh and Farzad Didehvar},
journal= {arXiv preprint arXiv:0906.2558},
year = {2009}
}
Comments
13 pages 7 figures