Skip to main content
Open Access Publications from the University of California

On a Distance Function for Ordered Lists


Given two ordered lists of the same elements, we define their distance as the sum for each element of the absolute value of the difference of each element's position in the two lists. Various properties of this distance function are exhibited. In particular, a given list is "far", on the average, from a random list of the same elements.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View