![]() КАТЕГОРИИ: Архитектура-(3434)Астрономия-(809)Биология-(7483)Биотехнологии-(1457)Военное дело-(14632)Высокие технологии-(1363)География-(913)Геология-(1438)Государство-(451)Демография-(1065)Дом-(47672)Журналистика и СМИ-(912)Изобретательство-(14524)Иностранные языки-(4268)Информатика-(17799)Искусство-(1338)История-(13644)Компьютеры-(11121)Косметика-(55)Кулинария-(373)Культура-(8427)Лингвистика-(374)Литература-(1642)Маркетинг-(23702)Математика-(16968)Машиностроение-(1700)Медицина-(12668)Менеджмент-(24684)Механика-(15423)Науковедение-(506)Образование-(11852)Охрана труда-(3308)Педагогика-(5571)Полиграфия-(1312)Политика-(7869)Право-(5454)Приборостроение-(1369)Программирование-(2801)Производство-(97182)Промышленность-(8706)Психология-(18388)Религия-(3217)Связь-(10668)Сельское хозяйство-(299)Социология-(6455)Спорт-(42831)Строительство-(4793)Торговля-(5050)Транспорт-(2929)Туризм-(1568)Физика-(3942)Философия-(17015)Финансы-(26596)Химия-(22929)Экология-(12095)Экономика-(9961)Электроника-(8441)Электротехника-(4623)Энергетика-(12629)Юриспруденция-(1492)Ядерная техника-(1748) |
Criterion of a consent of Kolmogorov
Probabilistic and statistical aspects of imitating modeling Often mathematical models of the systems interesting us contain accidental parameters of their functioning and/or accidental external impacts. Example 2.1. Work of a hairdressing salon is researched. Accidental external impacts – time intervals between the next visitors δ1, δ2, …. Accidental parameters of functioning – times τ1 (l), τ2 (l), … servicing of the next clients of l – m the hairdresser. A research purpose – to solve, how many to hire hairdressers that the average time of expectation in queue didn't exceed the set size. For this purpose it is necessary to lose some working days (are accelerated) and to look what will be queue in case of different number of hairdressers. To lose day of work, it will be required to generate specific values d1, d2, … sizes δ1, δ2, …. We will consider that δ1, δ2, … – the independent, equally distributed random variables: i.e. d1, d2, … – implementation of selection of distribution. For some random variables, we will tell δ, we assume a certain type of distribution, for example exponential, for others (τ1 (l)) a type of distribution isn't clear, and there is a task of check of a hypothesis that this some fixed (standard) distribution which we assume. The main ("zero") hypothesis consists that function of distribution of a random variable ξ is some fixed function
alternative hypothesis – distribution function another:
For check of these hypotheses we use selection of supervision of size ξ:
Empirical function of distribution:
If H 0 is fair,
Kolmogorovs Theorem. If Example 2.2. On selection
From picture We can see, that d 4 = ¾. According to tables [7, table 6.2] we find SL <0.01 (0.01 precisely for 0.734). Such significance value of data is interpreted as "the high importance, H0 almost for certain doesn't prove to be true", ξhas no distribution of U(1, 5). Kolmogorovs Theorem.. K(x) is called Kolmogorovs distribution [7, table 6.1].
Example 2.2 (continuation): As empirical function of distribution is step, and Consent criteria χ2 Hypotheses (1), (2) according to data (3) are again checked. Algorithm of actions: We will break area of possible values of a random variable ξon H0 on r of intervals To these intervals on distribution of H0 there correspond probabilities of hit ξ in them ν k – number of supervision (sample units) which got to k-y an interval (
Compare statistics
Pearsons Theorem. In case of justice of H0 distribution of statistics of H2 aims in case of Heuristic proof: according to Moivre – Laplace theorem
According to Pearsons theorem
Owing to approximate nature of a formula (5) it is desirable to provide If Definition. Diagram We will check H0 hypothesis that p 1 = F 0(4) – F 0(-∞) = 0.262, p 2 = F 0(5) – F 0(4) = 0.252, p 3 = 0.246, p 4 = 0.156, p 5 = 0.084.
SL is great (> 0.1), data aren't significant against H0, it could be supervision of a normal random variable. Generation of the pseudorandom numbers which are regularly distributed on a piece [0, 1] Carrying out imitation will require implementation
distributions Practically we receive numbers (6) by consecutive appeals to some sensor which can be the physical device connected with a case or the computer program which develops various numbers. In the latter case these numbers call pseudorandom with distribution Thus, we expect (and it is necessary to check it) from pseudorandom numbers with distribution of U(0, 1): – uniformity, i.e. consent with distribution of U(0, 1). – accident.
Criterion of accident Let there is an ordered set of numbers
(or a train – final sequence). Definition. The train is called accidental if it is selection implementation. According to data (7) it is necessary to check a hypothesis that is the independent equally distributed random variables, in case of alternative of H1 it not so. We will consider in the beginning a case when elements in (7) can be only two types (1 and 0, And and In,…). Example 2.7. Train 10100011010. In really random check of this kind we don't expect that all "1" will get off together, and we don't expect that they will regularly alternate with "0". In a train of elements of two types the set of the going in a row identical elements limited to opposite elements, either the beginning, or end is called as a series. As statistics of criterion we will choose a random number of series K. We will designate: N1 – number of elements than which in a train it is less; N2 – number of elements than which in a train it is more. It is possible to show that in case of justice of H0 SL (k) = P { K = k or further away from MK (all "tail") + K belongs to opposite "tail" with the same probability | H0 }.
In case of the fixed SL = α it is possible to tabulate sizes Example 2.7 (continuation): N1 = 5, N2 = 6, number of series k = 8. According to the table of distribution of K [7, table 6.7]:
Means, SL> 0.1, data aren't significant against H0, the train is accidental.
If either N1, or N2> 20, statistics
Now let numbers (7) – allegedly selection of arbitrary continuous distribution. It is possible to resolve an issue of not accident of this train as follows. We will remember: a median – a quantile about 0.5; the selective median of M e is equal to a median element of a variational series if number of supervision odd, and it is equal to a floor the amount of 2 median elements of a variational series if number of supervision even. We will constitute differences If the train (7) accidental, consecutive excess of a median is independent events and the train of signs will be accidental therefore if a train of signs the nonrandom, and initial train wasn't accidental. Multiplicative congruent method generation pseudorandom Numbers Let x n -1 - a number (0, 1). Obtain The algorithm can be rewritten. Let a n - integer, M - large integer,
Definition. Alance of the division of a natural number p by a positive integer q denotes (p) mod q. Formula (10) can be rewritten
algorithm is (11), (9) easier to implement on a computer. The sequence P (11) always loops, ie. e. beginning with some n = 0 to the period length T, which then repeats endlessly smiling. L - length of the segment aperiodicity.
Дата добавления: 2014-10-23; Просмотров: 834; Нарушение авторских прав?; Мы поможем в написании вашей работы! Нам важно ваше мнение! Был ли полезен опубликованный материал? Да | Нет |