Abstract Given a pairwise distance D on the elements in finite set X , order Δ (D) is defined by first associating total preorder ≼ x to each ∈ based and then quantifying disagreement between these preorders. The can be useful relational analyses because using instead of may make such less sensitive small variations . Relatively little known about properties for general distances Indeed, nearly...