Polynomial Time Relatively Computable Triangular Arrays in a Multinomial Setting

TL;DR

This paper extends previous methods to multinomial distributions satisfying certain properties, enabling polynomial-time computation for relatively computable triangular arrays in a setting related to the Central Limit Theorem.

Contribution

It generalizes earlier results to a broader class of multinomial distributions, covering those arising from the direct proof of the CLT.

Findings

Extends polynomial-time methods to multinomial distributions

Includes all multinomials from the direct CLT proof

Achieves computational efficiency in a broad setting

Abstract

We extend the methods and results of [arXiv 1603.04896] to the setting of multinomial distributions satisfying certain properties. These include all the multinomial distributions arising from the direct proof of the Central Limit Theorem given in [arXiv: 1507.00357], which, by results of that paper, constitutes essentially full generality for the situations in which the Central Limit Theorem holds.