An algorithmic and a geometric characterization of coarsening at random

DOI10.1214/07-AOS532MaRDI QIDQ955146zbMATH OpenOpenAlexWikidataFDO

Authors Richard D. Gill, Peter D. Grünwald

Publication date 18 November 2008

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0811.0683

zbMATH Keywords

ignorabilityFibonacci numberscoarsening at random (CAR)uniform multicover

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Characterization and structure theory of statistical distributions (62E10)

Abstract: We show that the class of conditional distributions satisfying the coarsening at random (CAR) property for discrete data has a simple and robust algorithmic description based on randomized uniform multicovers: combinatorial objects generalizing the notion of partition of a set. However, the complexity of a given CAR mechanism can be large: the maximal "height" of the needed multicovers can be exponential in the number of points in the sample space. The results stem from a geometric interpretation of the set of CAR distributions as a convex polytope and a characterization of its extreme points. The hierarchy of CAR models defined in this way could be useful in parsimonious statistical modeling of CAR mechanisms, though the results also raise doubts in applied work as to the meaningfulness of the CAR assumption in its full generality.

Recommendations

• scientific article; zbMATH DE number 1104326
• Ignorability and coarse data
• Relative coarsening at random
• Computational aspects of the coarsening at random model and the Shapley value
• scientific article; zbMATH DE number 1104327

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 1104326 (Why is no real title available?)
• scientific article; zbMATH DE number 2000824 (Why is no real title available?)
• scientific article; zbMATH DE number 2243414 (Why is no real title available?)
• Ignorability and coarse data
• Ignorability for categorical data

Cited in

(8)

• scientific article; zbMATH DE number 2243414 (Why is no real title available?)
• Robust probability updating
• Computational aspects of the coarsening at random model and the Shapley value
• Survival analysis with censored data: a further twist on ignorability conditions
• On the testability of coarsening assumptions: a hypothesis test for subgroup independence
• The joint distribution of the discrete random set vector and bivariate coarsening at random models
• Analysis of rounded exponential data
• Volumes of subset Minkowski sums and the Lyusternik region

This page was built for publication: An algorithmic and a geometric characterization of coarsening at random

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