TOPICS
Search

Gromov-Hausdorff-Prokhorov Distance


The Gromov-Hausdorff-Prokhorov distance between compact metric spaces carrying probability measures compares both their geometry and their measures after isometric embedding into a common metric space. One convention is

 d_(GHP)((X,d_X,mu_X),(Y,d_Y,mu_Y))=inf_(Z,f,g)max{d_H^Z(f(X),g(Y)),d_P^Z(f_*mu_X,g_*mu_Y)},

where f and g are isometric embeddings into Z, d_H is Hausdorff distance, and d_P is the Prokhorov metric. The distance is zero precisely when there is a measure-preserving isometry between the spaces. Random planar map scaling limits use this distance to retain the corner probability measure along with graph distance.


See also

Gromov-Hausdorff Distance, Hausdorff Distance, Prokhorov Metric, Random Planar Map

Explore with Wolfram|Alpha

References

Abraham, R.; Delmas, J.-F.; and Hoscheit, P. "A Note on the Gromov-Hausdorff-Prokhorov Distance Between (Locally) Compact Metric Measure Spaces." Electron. J. Probab. 18, No. 14, 1-21, 2013. https://doi.org/10.1214/EJP.v18-2116.Addario-Berry, L. and Wen, Y. "Joint Convergence of Random Quadrangulations and Their Cores." Ann. Inst. H. Poincaré Probab. Statist. 53, 1890-1920, 2017. https://doi.org/10.1214/16-AIHP775.

Cite this as:

Weisstein, Eric W. "Gromov-Hausdorff-Prokhorov Distance." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Gromov-Hausdorff-ProkhorovDistance.html

Subject classifications