Abstract
In this paper, we provide an application-oriented characterization of a class of distance functions monotonically related to the Euclidean distance in terms of some general properties of distance functions between real-valued vectors. Our analysis hinges upon two fundamental properties of distance functions that we call “value-sensitivity” and “order-sensitivity”. We show how these two general properties, combined with natural monotonicity considerations, lead to characterization results that single out several versions of Euclidean distance from the wide class of separable distance functions. We then discuss and motivate our results in two different and apparently unrelated application areas—mobility measurement and spatial voting theory—and propose our characterization as a test for deciding whether Euclidean distance (or some suitable variant) should be used in your favourite application context.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
