Geometry of Comparisons

06/17/2020
by   Puoya Tabaghi, et al.
0

Many data analysis problems can be cast as distance geometry problems in space forms—Euclidean, elliptic, or hyperbolic spaces. We ask: what can be said about the dimension of the underlying space form if we are only given a subset of comparisons between pairwise distances, without computing an actual embedding? To study this question, we define the ordinal capacity of a metric space. Ordinal capacity measures how well a space can accommodate a given set of ordinal measurements. We prove that the ordinal capacity of a space form is related to its dimension and curvature sign, and provide a lower bound on the embedding dimension of non-metric graphs in terms of the ordinal spread of their sub-cliques. Computer experiments on random graphs, Bitcoin trust network, and olfactory data illustrate the theory.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset