please consider:

• including the abstract of these articles in the body, rather than making so minimal a link-post;
• using /abs/ routes, rather than /pdf/;
• sometimes, there is an /html/ route available, and in those cases, it might be the best compromise

I must admit, even though most of your links and comments go way over my head, I'm glad that you're still here and leaving these breadcrumbs in case people do find them interesting... it would be unfortunate for the weird spirits to drift away until SN remains just a Bitcoin-adjacent SEO saloon.

quoting the abstract below, so future readers can judge before clicking:

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.