Depth profiles and the geometric exploration of random objects through optimal transport
share
We propose new tools for the geometric exploration of data objects taking values in a general separable metric space (Ω, d). Given a probability measure on Ω, we introduce depth profiles, where the depth profile of an element ω∈Ω refers to the distribution of the distances between ω and the other elements of Ω. Depth profiles can be harnessed to define transport ranks, which capture the centrality of each element in Ω with respect to the entire data cloud based on the optimal transport maps between the depth profiles. We study the properties of transport ranks and show that they provide an effective device for detecting and visualizing patterns in samples of random objects. Specifically, we study estimates of depth profiles and transport ranks based on samples of random objects and establish the convergence of the empirical estimates to the population targets using empirical process theory. We demonstrate the usefulness of depth profiles and associated transport ranks and visualizations for distributional data through a sample of age-at-death distributions for various countries, for compositional data through energy usage for U.S. states and for network data through New York taxi trips.
READ FULL TEXT