An algorithmic and a geometric characterization of Coarsening At Random
@article{Gill2005AnAA,
title={An algorithmic and a geometric characterization of Coarsening At Random},
author={R. Gill and Peter D. G{\"u}unwald},
journal={ArXiv},
year={2005},
volume={abs/math/0510276}
}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… CONTINUE READING
Figures and Topics from this paper
Figures
14 Citations
The Joint Distribution of the Discrete Random Set Vector and Bivariate Coarsening at Random Models
- Mathematics
- 2021
Combinatorial Entropy Power Inequalities: A Preliminary Study of the Stam Region
- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2019
- 14
- Highly Influenced
- PDF
On Consistency of Estimators Based on Random Set Vector Observations
- Mathematics, Computer Science
- Causal Inference in Econometrics
- 2016
- 1
- PDF
On the testability of coarsening assumptions: A hypothesis test for subgroup independence
- Mathematics, Computer Science
- Int. J. Approx. Reason.
- 2017
- 2
- PDF
Efficient Algorithms for Minimax Decisions Under Tree-Structured Incompleteness
- Computer Science
- ECSQARU
- 2019
- PDF
The entropy power of a sum is fractionally superadditive
- Mathematics, Computer Science
- 2009 IEEE International Symposium on Information Theory
- 2009
- 10
- PDF
References
SHOWING 1-10 OF 11 REFERENCES
Ignorability in Statistical and Probabilistic Inference
- Mathematics, Computer Science
- J. Artif. Intell. Res.
- 2005
- 17
- Highly Influential
- PDF
Theory of linear and integer programming
- Mathematics, Computer Science
- Wiley-Interscience series in discrete mathematics and optimization
- 1999
- 4,172
- Highly Influential
- PDF
Coarsening at random: Characterisations , conjectures and counter-examples
- Proceedings First Seattle Conference on Biostatistics (D. Lin
- 1997
Coarsening at random: Characterisations, conjectures and counter-examples
- Proceedings First Seattle Conference on Biostatistics (D. Lin, ed.) 255–294. Springer, New York.
- 1997