Every finite system of T1 uniformities comes from a single distance structure

DOI10.4995/AGT.2002.2113zbMATH Open1127.54305arXivmath/0201298OpenAlexW1529218657MaRDI QIDQ4806535FDOQ4806535

Authors: Jobst Heitzig 

Publication date: 14 May 2003

Published in: Applied General Topology (Search for Journal in Brave)

Abstract: Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distances rather than their actual values. Lower and upper bounds for representability probabilities are produced by experiments including random generation, a rubber-band algorithm for accuracy optimization, and automatic proof generation. It is proved that both farthest neighbour representations and cluster tree representations always exist in the plane. Moreover, a measure of order accuracy is introduced, and some lower bound on the possible accuracy is proved using some clustering method and a result on maximal cuts in graphs.

Full work available at URL: https://arxiv.org/abs/math/0201298

Recommendations

• Quasi-pseudometrics on quasi-uniform spaces and quasi-metrization of topological monoids
• Weightable quasi-uniformities
• Finite quasi-uniform extensions. II
• On some cardinal functions related to quasi-uniformities
• scientific article; zbMATH DE number 3915201

zbMATH Keywords

distance functionfree monoiduniformitygeneralized metric

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Several topologies on one set (change of topology, comparison of topologies, lattices of topologies) (54A10) Uniform structures and generalizations (54E15) Probabilistic metric spaces (54E70)

This page was built for publication: Every finite system of T1 uniformities comes from a single distance structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806535)