Polynomial time checking for generation of finite distributions of rational probabilities

  • Authors:

  • Roman Kolpakov

  • Affiliations:

  • Moscow State University, Moscow, Russia

  • Venue:
  • SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the generation of finite probabilistic distributions by discrete transformations. By discrete transformation of distributions we mean the distribution of a random variable which is a function of the values of independent random variables with initial distributions. We propose an algorithm which allows to determine in polynomial time whether a given distribution is generated by a given set of finite distributions of rational probabilities. Moreover, we describe all sets of finite distributions of rational probabilities which are closed under the considered generation. Among these sets we find all finitely generated sets. We also determine the structure of the lattice formed of these sets.