STATISTICS COLLOQUIUM

Query Processing for Network-Constrained Moving Objects

Richard Gill Mathematics Institute Leiden University

Tuesday, December 12, 2006, at 10:15 Room 4.39 third floor, J.B. Winsløws Vej 9B

ABSTRACT

We show that the class of conditional distributions satisfying the Coarsening at Random (CAR) property has a simple algorithmic description based on randomized uniform multicovers, which are combinatorial objects generalizing the notion of partition of a set. The maximum needed height of the multicovers is exponential in the number of points in the sample space. This algorithmic characterization stems 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 can be useful in parsimonious statistical modelling of CAR mechanisms.

Joint work with Peter Grünwald, CWI

References: arXiv.org: math.ST/0510276; to appear in Annals of Statistics

Slides: here.

Host: Bent Jørgensen

---

SDU HOME | IMADA HOME | Previous Page

---

Last modified: Wed Nov 29 09:05:37 CET 2006

Joan Boyar (joan@imada.sdu.dk)