Exact confidence nets based on finite reflection groups

  • Andrew R. Francis
  • , Milan Stehlik
  • , Henry Wynn

Research output: Working paper and reportsPreprint

Abstract

Confidence nets — that is, collections of confidence intervals that fill out parameter space and whose exact coverage can be computed — are familiar in nonparametric statistics. Here the distributional assumptions are based on invariance under the action of a finite reflection group. Exact confidence nets are exhibited for a single parameter, based on the root system of the group. The main result is a formula for the generating function of the interval probabilities. The proof makes elementary use of the theory of “buildings” and the Chevalley factorization theorem for the length distribution on Cayley graphs.
Original languageEnglish
Number of pages22
DOIs
Publication statusPublished - 2014

Publication series

NamearXiv.org
ISSN (Print)2331-8422

Fields of science

  • 101018 Statistics
  • 101024 Probability theory
  • 101029 Mathematical statistics
  • 509 Other Social Sciences

JKU Focus areas

  • Computation in Informatics and Mathematics

Cite this