Article
Licensed
Unlicensed
Requires Authentication
Prohibitions in discrete probabilistic statistical problems
-
A. A. Grusho
Published/Copyright:
July 15, 2011
Abstract
In this paper, we continue our studies concerning consistent sequences of tests in discrete probabilistic statistical schemes.
We introduce the concept of a ‘prohibition’ in a discrete probabilistic scheme and give a series of examples where ‘prohibitions’ arise.
In statistical problems, tests exist whose critical sets are completely determined by means of ‘prohibitions.’ We find necessary and sufficient conditions for existence of consistent sequences of tests in discrete schemes where all critical sets are defined by means of ‘prohibitions.’
Received: 2010-12-13
Published Online: 2011-07-15
Published in Print: 2011-July
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Prohibitions in discrete probabilistic statistical problems
- An asynchronous double stochastic flow with initiation of superfluous events
- Asymptotic expansions for the distribution of the number of components in random mappings and partitions
- Symmetric linear spaces of graphs
- On automorphisms of commutative Moufang loops
- On the mixing properties of operations in a finite field
- The predicate method to construct the Post lattice
- Average complexity of searching for identical objects in random nonuniform databases
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
Articles in the same Issue
- Prohibitions in discrete probabilistic statistical problems
- An asynchronous double stochastic flow with initiation of superfluous events
- Asymptotic expansions for the distribution of the number of components in random mappings and partitions
- Symmetric linear spaces of graphs
- On automorphisms of commutative Moufang loops
- On the mixing properties of operations in a finite field
- The predicate method to construct the Post lattice
- Average complexity of searching for identical objects in random nonuniform databases
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
