- •Introduction
- •Basic concepts of probability theory
- •Classical definition of probability
- •Relative frequency
- •Geometric probabilities
- •Glossary
- •Exercises for Seminar 1
- •Exercises for Homework 1
- •Basic formulas of combinatorial analysis
- •Operations over events
- •Glossary
- •Exercises for Seminar 2
- •Exercises for Homework 2
- •Theorem of addition of probabilities of incompatible events
- •Complete group of events
- •Opposite events
- •Conditional probability
- •Theorem of multiplication of probabilities
- •Glossary
- •Exercises for Seminar 3
- •Exercises for Homework 3
- •Independent events
- •Where a is the appearance of at least one of the events a1, a2, …, An; .
- •Glossary
- •Exercises for Seminar 4
- •Exercises for Homework 4
- •Theorem of addition of probabilities of compatible events
- •Formula of total probability
- •Probability of hypotheses. Bayes’s formulas.
- •Glossary
- •Exercises for Seminar 5
- •Exercises for Homework 5
- •Repetition (recurrence) of trials. The Bernoulli formula
- •Local theorem of Laplace
- •Integral theorem of Laplace
- •Glossary
- •Exercises for Seminar 6
- •Exercises for Homework 6
- •Random variables. The law of distribution of a discrete random variable
- •A random variable is understood as a variable which as result of a trial takes one of the possible set of its values (which namely – it is not beforehand known).
- •Mathematical operations over random variables
- •(Mathematical) expectation of a discrete random variable
- •Dispersion of a discrete random variable
- •Glossary
- •Exercises for Seminar 7
- •Exercises for Homework 7
- •Distribution function of a random variable
- •Properties of a distribution function
- •Continuous random variables. Probability density
- •Properties of probability density
- •Glossary
- •Exercises for Seminar 8
- •Exercises for Homework 8
- •Basic laws of distribution of discrete random variables
- •1. Binomial law of distribution
- •2. The law of distribution of Poisson
- •3. Geometric distribution
- •4. Hypergeometric distribution
- •Glossary
- •Exercises for Seminar 9
- •Exercises for Homework 9
- •Basic laws of distribution of continuous random variables
- •1. The uniform law of distribution
- •2. Exponential law of distribution
- •3. Normal law of distribution
- •Glossary
- •Exercises for Seminar 10
- •Exercises for Homework 10
- •The law of large numbers and limit theorems
- •The central limit theorem
- •Glossary
- •Exercises for Seminar 11
- •Exercises for Homework 11
- •Mathematical statistics. Variation series and their characteristics
- •Numerical characteristics of variation series
- •Glossary
- •Exercises for Seminar 12
- •Exercises for Homework 12
- •Bases of the mathematical theory of sampling
- •Glossary
- •Exercises for Seminar 13
- •Exercises for Homework 13
- •Methods of finding of estimations
- •Notion of interval estimation
- •Glossary
- •Exercises for Seminar 14
- •Exercises for Homework 14
- •Testing of statistical hypotheses
- •Glossary
- •Exercises for Seminar 15
- •Exercises for Homework 15
- •Individual homeworks
- •Variant 1
- •Variant 2
- •Variant 3
- •Variant 4
- •Variant 5
- •Variant 6
- •Variant 7
- •Variant 8
- •Variant 9
- •Variant 10
- •Variant 11
- •Variant 12
- •Variant 13
- •Variant 14
- •Variant 15
- •Variant 16
- •Variant 17
- •Variant 18
- •Variant 19
- •Variant 20
- •Variant 21
- •Variant 22
- •Variant 23
- •Variant 24
- •Variant 25
- •Final exam trial tests (for self-checking)
- •Appendix
- •Values the functions and
- •List of the used books
- •Contents
The law of large numbers and limit theorems
The law of large numbers in a broad sense is understood as the general principle according to which, under the formulation of academician A.N. Kolmogorov, cumulative action of the large number of random factors leads (at the some rather general conditions) to a result almost independent from a case. In other words, at the large number of random variables their average result ceases to be random and can be predicted with the big degree of definiteness.
The law of large numbers in a narrow sense is understood as a series of mathematical theorems, in each of which for those or other conditions the fact of approximation of average characteristics of the large number of trials to some certain constants is established.
Theorem (The Markov inequality). If a random variable X takes only non-negative values and has a mathematical expectation M(X) then for every positive number A the following inequality holds:
P(X > A) M(X)/A
Since the events X > A and X A are opposite, changing P(X > A) by 1 – P(X A) we have another form of the Markov inequality:
P(X A) 1 – M(X)/A
The Markov inequality is applicable for all non-negative random variables.
Example. The average amount of calls entering on the switchboard of a factory within one hour is equal to 300. Estimate the probability that the number of calls on the switchboard within a randomly chosen hour: a) will exceed 400; b) will be no more than 500.
Solution:
a) By the hypothesis M(X) = 300. By the Markov inequality we have P(X >400) 300/400, i.e. the probability that the number of calls will exceed 400 is no more than 0,75.
b) By another form of the Markov inequality P(X A) 1 – 300/500 = 0,4, i.e. the probability that the number of calls will be no more than 500 is no less than 0,4.
Example. The sum of all deposits in a branch of bank makes 2 million roubles, and the probability that a randomly taken deposit will not exceed 10 thousand roubles is equal to 0,6. What is it possible to tell about the number of depositors?
Solution: Let X be the size of a randomly taken deposit, and n be the number of all deposits. Then by the hypothesis the average size of deposit M(X) = 2000/n (thousand roubles). By the Markov inequality:
Taking in account that P(X 10) = 0,6 we obtain 1 – 200/n 0,6; and consequently n 500, i.e. the number of depositors is no more than 500.
Theorem (The Chebyshev inequality). For every random variable X having a mathematical expectation M(X) and a dispersion D(X) the following inequality holds:
P (|X – a| > ) D(X)/ 2
where a = M(X), > 0.
Since the events |X – a| > and |X – a| are opposite, the Chebyshev inequality can be written in another form:
P(|X – a| ) 1 – D(X)/ 2
The Chebyshev inequality is applicable for all random variables.
Example. The average expense of water on a cattle-breeding farm makes 1000 litres in a day, and the mean square deviation of this random variable does not exceed 200 litres. Estimate the probability that the expense of water on the farm in a randomly chosen day will not exceed 2000 litres by using: a) the Markov inequality; b) the Chebyshev inequality.
Solution: a) Let X be an expense of water on a cattle-breeding farm. By the hypothesis M(X) = 1000. Using the Markov inequality we obtain P(X 2000) 1 – 1000/2000 = 0,5, i.e. no less than 0,5.
b) The dispersion D(X) = 2 2002. Since the boundaries of the interval 0 X 2000 are symmetric according to the mathematical expectation M(X) = 1000, for estimating the probability of the required event one can apply the Chebyshev inequality:
i.e. no less than 0,96. In the present example an estimating the probability of the event found by the Markov inequality (P 0,5) was made more precisely by the Chebyshev inequality (P 0,96).
The Chebyshev theorem. If the dispersions of n independent random variables X1, X2, …, Xn are bounded by the same constant C then the arithmetic mean of random variables converges on probability to the arithmetic mean of their mathematical expectations a1, a2, …, an for an unbounded increasing the number n, i.e.
a
nd
Underline
the sense of the Chebyshev theorem. For a large number n
of random variables X1,
X2,
…, Xn
it is practically certain that their arithmetic mean
– a random
variable – very little differs from non-random
quantity
,
i.e. it practically ceases to be random.
Corollary. If independent random variables X1, X2, …, Xn have identical mathematical expectations which equal a, and their dispersions are bounded by the same constant C then
and
The Chebyshev theorem and its corollary have the big practical value. For example, it is necessary for an insurance company to establish the size of an insurance payment which the insurant should pay; thus the insurance company undertakes to pay a certain insurance sum at occurrence of an insurance case. Considering frequency/losses of the insurant at occurrence of an insurance case as a random variable and possessing by known statistics of such cases, it is possible to determine the average number/average losses at happening of insurance cases which on the basis of the Chebyshev theorem with the big degree of confidence can be considered as almost non-random quantity. Then the size of an insurance payment is determined on the basis of these data and the prospective insurance sum. Without taking into account action of the law of large numbers (the Chebyshev theorem) essential losses of the insurance company are possible (at understating the size of an insurance payment), or loss of appeal of insurance services (at overestimating the size of a payment).
Example. For determination of the average duration of burning electric lamps in a batch of 200 identical boxes it has been taken on sample on one lamp from each box. Estimate the probability that the average duration of burning the selected 200 electric lamps differs from the average duration of burning lamps in all batch no more than on 5 hours (by absolute value) if it is known that the mean square deviation of duration of burning lamps in each box is less than 7 hours.
Solution: Let Xi be duration of burning a lamp taken from the i-th box (hours). By the hypothesis the dispersion D(Xi) < 72 = 49. Obviously, the average duration of burning the selected lamps is equal to (X1 + X2 + … + X200)/200, and the average duration of burning lamps in all batch is (M(X1) + M(X2) + … + M(X200))/200 = (a1 + a2 + … + a200)/200. Then the probability of the required event is
i.e. no less than 0,9902.
The
Bernoulli theorem.
The relative frequency of an event in n
repeated independent trials, in each of which the event can occur
with the same probability p,
converges on probability to probability p
of the event in a single trial for an unbounded increasing the number
n:
and
The Bernoulli theorem gives a theoretical substantiation of replacement of unknown probability of an event by its relative frequency obtained in n repeated independent trials spent at the same complex of conditions. So, for example, if the probability of a birth of boy isn’t known, as its value we can accept the relative frequency of this event which on long-term statistical data makes approximately 0,515.
Example. A coin is tossed 1000 times. Give a lower bound for the probability that the absolute value of a deviation of the relative frequency of appearance of heads from the probability of its appearance is less than 0,1.
Solution: Here n = 1000, p = q = 0,5; = 0,1. Consequently,
