2020/08/02 by Acosta, María Florencia, Aimar, Hugo, Gómez, Ivana
#Analysis of PDEs (math.AP) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #General Topology (math.GN) #Machine Learning (cs.LG)
paper · doi:10.48550/arxiv.2008.00569
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.