On L-decomposability of random orderings

DOI10.1016/J.JMP.2009.04.011zbMATH Open1178.60017OpenAlexW2015393723MaRDI QIDQ734686FDOQ734686

Authors: Villő 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

Recommendations

• scientific article; zbMATH DE number 2237591
• scientific article; zbMATH DE number 218922
• scientific article; zbMATH DE number 1163776
• On ``choice probabilities derived from ranking distributions
• The ordering of conditionally weak positive quadrant dependence

zbMATH Keywords

conditional independenceL-decomposabilityrandom orderings

Mathematics Subject Classification ID

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

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
• NON-NULL RANKING MODELS. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multistage Ranking Models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The repeated insertion model for rankings: missing link between two subset choice models
• Title not available (Why is that?)

Cited In (4)

• Algebraic properties of classes of path ideals of posets
• Mallows and generalized Mallows model for matchings
• Commutative algebra of statistical ranking
• Order statistics for decomposable combinatorial structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734686)