A ban means a sequence which has zero probability in a finite space. Generation of probability models is carried out, as a rule, from simpler models by introduction of additional restrictions. However fulfilment of required properties for stochastic processes requires the proof in case of introduction of additional restrictions. In particular, the proof is required that restrictions on admissibility of trajectories don’t destroy the property of being a random process that is to satisfy to the Kolmogorov’s theorem. The paper deals with conditions under which introduction of restrictions on trajectories of random sequences according to the given specification of the smallest bans again generates random process. When the probability measure Q is generated by restrictions defined by bans we consider testing of sequence of hypotheses H0, n : Qn against H1, n : Pn, where Q possesses the specification of the smallest bans, P is a uniform measure and Qn, Pn are projections of measures Q and P . The existence of consistency of sequence test defined by bans is investigated.
[1]
Stefan Axelsson,et al.
The base-rate fallacy and its implications for the difficulty of intrusion detection
,
1999,
CCS '99.
[2]
A E Bostwick,et al.
THE THEORY OF PROBABILITIES.
,
1896,
Science.
[3]
Elena E. Timonina,et al.
Consistent Sequences of Tests Defined by Bans
,
2013
.
[4]
Alexander A. Grusho,et al.
Criteria On Statistically Defined Bans
,
2013,
ECMS.
[5]
Elena E. Timonina,et al.
Prohibitions in discrete probabilistic statistical problems
,
2011
.
[6]
A. R. Davidson.
Theory of Probabilities.
,
1953
.