On Frink's type metrization of weighted graphs
arXiv:2008.00569v1
AI Analysis
This provides a method for graph analysis, but it appears incremental as it applies an existing theorem to a specific graph type.
The authors tackled the problem of computing a metric between vertices in affinity-weighted undirected graphs by developing an explicit algorithm based on Frink's metrization theorem, which they tested and compared.
Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted undirected graph.