On L-decomposability of random orderings

DOI10.1016/j.jmp.2009.04.011zbMath1178.60017OpenAlexW2015393723MaRDI QIDQ734686

Villo Csiszár

Publication date: 13 October 2009

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmp.2009.04.011

zbMATH Keywords

conditional independenceL-decomposabilityrandom orderings

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05)

Related Items (3)

Algebraic properties of classes of path ideals of posets ⋮ Commutative algebra of statistical ranking ⋮ Mallows and generalized Mallows model for matchings

Cites Work

• Probability models on rankings
• Probability models and statistical analyses for ranking data. Papers presented at the AMS-IMS-SIAM conference, Amherst, MA, USA, June 1990
• The repeated insertion model for rankings: missing link between two subset choice models
• NON-NULL RANKING MODELS. I
• Multistage Ranking Models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On L-decomposability of random orderings