REVIEW 4 cited by
Lectures on Hausdorff and Gromov-Hausdorff Distance Geometry
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The course was given at Peking University, Fall 2019. We discuss the following subjects: (1) Introduction to general topology, hyperspaces, metric and pseudometric spaces, graph theory. (2) Graphs in metric spaces, minimum spanning tree, Steiner minimal tree, Gromov minimal filling. (3) Hausdorff distance, Vietoris topology, Limits theory, inheritance of completeness, total boundedness, compactness by hyperspaces. (4) Gromov-Hausdorff distance, triangle inequality, positive definiteness for isometry classes of compact spaces, counterexample for boundedly compact spaces. (5) Gromov-Hausdorff distance for separable spaces in terms of their isometric images in \ell_\infty, correspondences, Gromov-Hausdorff distance in terms of correspondences. (6) Epsilon-isometries and Gromov-Hausdorff distance. (7) Irreducible correspondences and Gromov-Hausdorff distance. (8) Gromov-Hausdorff convergence, inheritance of metric and topological properties while Gromov-Hausdorff convergence. (9) Gromov-Hausdorff space (GH-space), optimal correspondences, existence of closed optimal correspondences for compact metric spaces, GH-space is geodesic. (10) Cover number, packing number, total boundedness, completeness, and separability of GH-space. (11) mst-spectrum in terms of GH-distances to simplexes, Steiner problem in GH-space. (12) GH-distance to simplexes with more points, GH-distance to simplexes with at most the same number of points. (13) Generalized Borsuk problem, solution of Generalized Borsuk problem in terms of GH-distances, clique covering number and chromatic number of simple graphs, their dualities, calculating these numbers in terms of GH-distances.
Forward citations
Cited by 4 Pith papers
-
On the Existence of Minimal Parametric Networks
Compactly equipped pseudometric spaces—where each closed ball carries a compact topology making the distance lower semicontinuous—always contain minimal parametric networks of any type.
-
Quasi-isometric modification of Gromov-Hausdorff distance
A quasi-isometric analogue of the Gromov–Hausdorff distance is defined, shown to sit between GH and pointed-GH convergence, metrizable, and path-connected on quasi-isometry classes.
-
Gromov-Hausdorff distance between chromatic metric pairs and stability of the six-pack
Introduces the C-constrained Gromov-Hausdorff distance for chromatic metric pairs and proves that all six diagrams in a six-pack are stable in bottleneck distance with respect to it, up to a factor of 2.
-
Ultrametric spaces and clouds
The ultrametrization map U is 1-Lipschitz on all metric spaces, preserves products with dotted connected spaces, and forces mutual exclusion of ultrametric and dotted connected spaces in unbounded clouds.
Discussion (0). Continue with ORCID to comment.