Finite Asymptomatic Clusters of Metric Spaces

DOI10.20429/TAG.2018.050201zbMATH Open1430.54031arXiv1801.01014OpenAlexW2963464271MaRDI QIDQ5225546FDOQ5225546

Authors: V. V. Bilet, Aleksey A. Dovgoshey

Publication date: 22 July 2019

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Abstract: Let

(X, d)

be an unbounded metric space and let

i l d e r = (r_{n})_{n i n m a t h b b N}

be a sequence of positive real numbers tending to infinity. A pretangent space

O m e g a_{i n f t y, i l d e r}^{X}

to

(X, d)

at infinity is a limit of the rescaling sequence

l e f t (X, f r a c 1 r_{n} d i g h t) .

The set of all pretangent spaces

O m e g a_{i n f t y, i l d e r}^{X}

is called an asymptotic cluster of pretangent spaces. Such a cluster can be considered as a weighted graph

(G_{X, i l d e r}, h o_{X})

whose maximal cliques coincide with

O m e g a_{i n f t y, i l d e r}^{X}

and the weight

h o_{X}

is defined by metrics on

O m e g a_{i n f t y, i l d e r}^{X}

. We describe the structure of metric spaces having finite asymptotic clusters of pretangent spaces and characterize the finite weighted graphs which are isomorphic to these clusters.

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

Recommendations

zbMATH Keywords

weighted graph finite metric space homomorphism of graphs asymptotics of metric space metrization of weighted graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Signed and weighted graphs (05C22) Metric spaces, metrizability (54E35)

Cited In (3)

This page was built for publication: Finite Asymptomatic Clusters of Metric Spaces

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