Abstract
Exploratory graphical methods are critically needed for displaying ranked data. Fully and partially ranked data are functions on the symmetric group of n elements, S n , and on the related coset spaces. Because neither S n nor its coset spaces have a natural linear ordering, graphical methods such as histograms and bar graphs are inappropriate for displaying ranked data. However, a very natural partial ordering on S n and its coset spaces is induced by two reasonable measures of distance: Spearman’s p and Kendall’s τ. Graphical techniques that preserve this partial ordering can be developed to display ranked data and to illustrate related probability density functions by using permutation polytopes. A polytope is the convex hull of a finite set of points in ℜn−1, and a permutation polytope is the convex hull of the n! permutations of n elements when regarded as vectors in ℜn (see, for example, Yemelichev, et. al.[9]). This concept is closely related to the observation by McCullagh [7] that the n! elements of S n lie on the surface of a sphere in ℜn−1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. S. Cleveland. The Elements of Graphing Data, Monterey: Wadsworth Advanced Books and Software, 1985.
H. S. M. Coxeter and W. O. Moser. Generators and Relations for Discrete Groups (4th ed.), Berlin: Springer-Verlag, 1980.
D. E. Critchlow. Metric Methods for Analyzing Partially Ranked Data, Berlin: Springer-Verlag, 1985.
D. E. Critchlow and J. S. Verducci. “Detecting a Trend in Paired Rankings,” Technical Report #418, Department of Statistics, The Ohio State University, 1989.
H. M. Cundy and A. P. Rollett. Mathematical Models, London: Oxford University Press. 1951.
P. Diaconis. Group Representations in Probability and Statistics, Hayward, California: Institute of Mathematical Statistics. 1988.
P. McCullagh. “Models on Spheres and Models on permutations,” Technical Report, Department of Statistics, University of Chicago. 1990.
R. Stanley. Enumerative Combinatorics, Monterey, California: Wadsworth and Brooks/Cole. 1986.
V. A. Yemelichev, M. M. Kovalev and M. K. Kravtsov. Polytopes, Graphs and Optimisation, Cambridge: Cambridge University Press, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Thompson, G.L. (1993). Graphical Techniques for Ranked Data. In: Fligner, M.A., Verducci, J.S. (eds) Probability Models and Statistical Analyses for Ranking Data. Lecture Notes in Statistics, vol 80. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2738-0_17
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2738-0_17
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97920-5
Online ISBN: 978-1-4612-2738-0
eBook Packages: Springer Book Archive