Skip to content
Research Article Open access CC BY 4.0

On Frink's Type Metrization of Weighted Graphs

Mara Florencia Acosta, Aimar, Hugo Alejandro, Hugo Aimar, Gomez, Ivana Daniela, Ivana Gomez, Acosta, Maria Florencia

Asian Research Journal of Mathematics · pp. 26–37 · Published 20 Feb 2021

10.9734/arjom/2021/v17i130262

Abstract

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 anity weighted undirected graph.

Metrization uniform spaces weighted graphs.

References (4)

  1. 1 Geometric Deep Learning: Going beyond Euclidean data [DOI]
  2. 2 Lipschitz functions on spaces of homogeneous type [DOI]
  3. 3 Distance functions and the metrization problem [DOI]
  4. 4 On the metrization problem and related problems in the theory of abstract sets [DOI]

Cited by 1

Diffusive Metrics Induced by Random Affinities on Graphs. An Application to the Transport Systems Related to the COVID-19 Setting for Buenos Aires (AMBA)

M. F. Acosta, H. Aimar, I. Gómez · Trends in Computational and Applied Mathematics · 2022

Article metrics

Real usage data collected on this platform.

25

Page views

0

PDF downloads

3

Outbound clicks

1

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.