Similarity Between Points in Metric Measure Spaces

This paper is about similarity between objects that can be represented as points in metric measure spaces. A metric measure space is a metric space that is also equipped with a measure. For example, a network with distances between its nodes and weights assigned to its nodes is a metric measure space. Given points x and y in different metric measure spaces or in the same space, how similar are they? A well known approach is to consider x and y similar if their neighborhoods are similar. For metric measure spaces, similarity between neighborhoods is well captured by the Gromov-Hausdorff-Prokhorov distance, but it is NP-hard to compute this distance even in quite simple cases. We propose a tractable alternative: the radial distribution distance between the neighborhoods of x and y. The similarity measure based on the radial distribution distance is coarser than the similarity based on the Gromov-Hausdorff-Prokhorov distance but much easier to compute.

[1]  R. Abraham,et al.  A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces , 2012, 1202.5464.

[2]  A. Blumberg,et al.  Topological Data Analysis for Genomics and Evolution: Topology in Biology , 2020 .

[3]  Facundo Mémoli,et al.  Eurographics Symposium on Point-based Graphics (2007) on the Use of Gromov-hausdorff Distances for Shape Comparison , 2022 .

[4]  Felix Schmiedl,et al.  Computational Aspects of the Gromov–Hausdorff Distance and its Application in Non-rigid Shape Matching , 2017, Discret. Comput. Geom..

[5]  L. Ambrosio,et al.  Gradient Flows: In Metric Spaces and in the Space of Probability Measures , 2005 .

[6]  M. Gromov Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[7]  Arcwise Isometries,et al.  A Course in Metric Geometry , 2001 .

[8]  Tao Lei Scaling limit of random forests with prescribed degree sequences , 2017, Bernoulli.

[9]  George Karypis,et al.  A Comprehensive Survey of Neighborhood-based Recommendation Methods , 2011, Recommender Systems Handbook.

[10]  Facundo Mémoli,et al.  Gromov–Wasserstein Distances and the Metric Approach to Object Matching , 2011, Found. Comput. Math..

[11]  Gr'egory Miermont,et al.  Tessellations of random maps of arbitrary genus , 2007, 0712.3688.

[12]  Anita Winter,et al.  Invariance principle for variable speed random walks on trees , 2017 .

[13]  Jacques Tits,et al.  Groups of polynomial growth and expanding maps (with an appendix by Jacques Tits) , 2018 .

[14]  Zane T. Smith,et al.  Gromov-Hausdorff distances on $p$-metric spaces and ultrametric spaces , 2019 .

[15]  Tao Lei Scaling limit of random forests with prescribed degree sequences , 2018 .

[16]  Léon Bottou,et al.  Wasserstein Generative Adversarial Networks , 2017, ICML.

[17]  D. Edwards The Structure of Superspace , 1975 .