Results 1 
6 of
6
Commutative algebra of statistical ranking
 J. ALGEBRA
, 2011
"... A model for statistical ranking is a family of probability distributions whose states are orderings of a fixed finite set of items. We represent the orderings as maximal chains in a graded poset. The most widely used ranking models are parameterized by rational function in the model parameters, so ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
A model for statistical ranking is a family of probability distributions whose states are orderings of a fixed finite set of items. We represent the orderings as maximal chains in a graded poset. The most widely used ranking models are parameterized by rational function in the model parameters, so they define algebraic varieties. We study these varieties from the perspective of combinatorial commutative algebra. One of our models, the PlackettLuce model, is nontoric. Five others are toric: the Birkhoff model, the ascending model, the CsiszÃ¡r model, the inversion model, and the BradleyTerry model. For these models we examine the toric algebra, its lattice polytope, and its Markov basis.
FAKE DEGREES FOR REFLECTION ACTIONS ON ROOTS
"... A finite irreducible real reflection group of rank ℓ and Coxeter number h has root system of cardinality h·ℓ. It is shown that the fake degree for the permutation action on its roots is divisible by [h]q = 1+q +q2 + · · ·+q h−1, and that in simplylaced types it equals [h]q · Pℓ i=1 qd∗i where d ∗ ..."
Abstract
 Add to MetaCart
(Show Context)
A finite irreducible real reflection group of rank ℓ and Coxeter number h has root system of cardinality h·ℓ. It is shown that the fake degree for the permutation action on its roots is divisible by [h]q = 1+q +q2 + · · ·+q h−1, and that in simplylaced types it equals [h]q · Pℓ i=1 qd∗i where d ∗ i = ei − 1 are the codegrees and ei are the exponents.
Diagonalization of the Matrices of the Multinomial Descent and Multinomial Inversion Statistics on the Symmetric Group
, 2013
"... ar ..."
(Show Context)
Multiresolution Analysis of Incomplete Rankings ∗
"... Incomplete rankings on a set of items {1,..., n} are orderings of the form a1 ≺ · · · ≺ ak, with {a1,... ak} ⊂ {1,..., n} and k < n. Though they arise in many modern applications, only a few methods have been introduced to manipulate them, most of them consisting in representing any incompl ..."
Abstract
 Add to MetaCart
(Show Context)
Incomplete rankings on a set of items {1,..., n} are orderings of the form a1 ≺ · · · ≺ ak, with {a1,... ak} ⊂ {1,..., n} and k < n. Though they arise in many modern applications, only a few methods have been introduced to manipulate them, most of them consisting in representing any incomplete ranking by the set of all its possible linear extensions on {1,..., n}. It is the major purpose of this paper to introduce a completely novel approach, which allows to treat incomplete rankings directly, representing them as injective words over {1,..., n}. Unexpectedly, operations on incomplete rankings have very simple equivalents in this setting and the topological structure of the complex of injective words can be interpretated in a simple fashion from the perspective of ranking. We exploit this connection here and use recent results from algebraic topology to construct a multiresolution analysis and develop a wavelet framework for incomplete rankings. Though purely combinatorial, this construction relies on the same ideas underlying multiresolution analysis on a Euclidean space, and permits to localize the information related to rankings on each subset of items. It can be viewed as a crucial step toward nonlinear approximation of distributions of incomplete rankings and paves the way for many statistical applications, including preference data analysis and the design of recommender systems.