Determination of Certain Statistical Characteristics for Identifying the Stochastic Relationship Between Two Random Variables on the Minsk-1 Computer
Abstract Generated abstract
The paper presents a standard program for the Minsk-1 computer intended to assess the existence and strength of a stochastic relationship between two random variables from a correlation table of paired observations. It describes the computation of empirical regression lines in both directions, initial moments up to the fourth order, arithmetic means, root-mean-square values, skewness, kurtosis, the correlation coefficient, and correlation ratios. The program is designed to maximize the working memory field without external storage, process any rectangular matrix fitting 564 cells, and was debugged and used in the computing laboratory of the Tomsk Polytechnic Institute.
Full Text
DETERMINATION OF SOME STATISTICAL CHARACTERISTICS FOR DETERMINING THE STOCHASTIC RELATIONSHIP BETWEEN TWO RANDOM VARIABLES ON THE “MINSK-1” COMPUTER
G. L. KALINICHENKO
(Presented by the scientific-technical conference of the AVTF)
Problem Statement
Suppose that, instead of a two-dimensional theoretical distribution law, a sample of \(n\) observations with two possible values is given. Each of the observations records a pair of associated values of the quantities being studied. All these \(n\) observations are entered into a correlation table, i.e., into a two-entry table (Table 1). Each row consists of possible values for a discrete random variable or of \(m\)-intervals for a continuous random variable \(X\), for a definite value of the random variable \(Y\). Similarly, each column consists of \(k\)-intervals for the random variable \(Y\) at a definite value of the random variable \(X\). In this table \(mk\) cells are filled in. In the cell corresponding to the \(j\)-th row and the \(i\)-th column, the number of observations with possible values \(X=x_i\) and \(Y=y_j\) is entered; we shall denote it by \(n_{ij}\). If the random variable is continuous, then in this cell is entered the number of observations for which
\[ x_i-\frac{\Delta x_i}{2} < x < x_i+\frac{\Delta x_i}{2} \quad \text{and} \quad y_j-\frac{\Delta y}{2} < y < y_j+\frac{\Delta y}{2}. \]
The task of the present work is to compile a standard program for the “Minsk-1” computer, with the largest possible working field and without the use of external storage, which would make it possible to give the researcher an answer concerning the existence and degree of stochastic relationship between two random variables under study.
Content of the work:
A standard program has been compiled for the “Minsk-1” computer which prints a table of values for the empirical regression line of \(y\) on \(x\) and \(X\) on \(y\). Empirical initial moments of the random variables \(X\) and \(Y\) up to and including the 4th order are found. This makes it possible to print arithmetic means, root-mean-square values of the random variables \(X\) and \(Y\), as well as coefficients of skewness and kurtosis, which allow one to obtain a first approximate idea of the closeness of the distribution under study to the normal distribution. The principal values, however, are the correlation coefficient and the coefficients of the correlation ratios, which make it possible to judge the presence and degree of stochastic relationship between two random variables. The standard program was compiled using the interpreting system of the “Minsk-1” computer with floating-point numbers recorded in one cell, used in the computing laboratory of the Tomsk Polytechnic Institute [2].
The greater part of the machine memory, from cell 0710 to cell 1777, is allocated for
initial data and makes it possible to process any rectangular matrix that can be placed in 564 cells.
The number of observations, however, is practically unlimited. Cells 0001 through 0436 are occupied by the interpreting program for writing floating-point numbers into one cell; cells 0440 through 0471 by the standard square-root extraction program; and cells 0472 through 0473 by the program itself, with working cells and pseudocodes for program self-restoration.
Before each input of new information, cells 0656 through 0661 are filled, as are cells 0502 and 0503.
| Cell | Value | Value | Value |
|---|---|---|---|
| 0656 | 00 | 000 | |
| 0657 | 00 | 0000 | |
| 0660 | 00 | 0000 | |
| 0661 | 00 | 0000 | |
| 0502 | 16 | + | 0700 |
| 0503 | 16 | + | 0700, |
where the number of columns is \(m\), and \(n\) is the number of rows of the matrix in the octal number system.
Into cells 0701 through 0707, the following corresponding numbers are entered in the decimal system:
\[ y_0,\ \Delta y,\ x_0,\ \Delta x_0,\ 2,\ 3,\ 4. \]
Program start from cell 0472.
This program has been debugged and is used in the computing laboratory of the Tomsk Polytechnic Institute.
Program for the “Minsk-1” Computer
| Cell | Op. | Addr. 1 | Addr. 2 | Cell | Op. | Addr. 1 | Addr. 2 |
|---|---|---|---|---|---|---|---|
| 0472 | 15 | 4000 | 0251 | 7 | 03 | 0026 | 0251 |
| 3 | 00 | 0012 | 05140530 | 00 | 0036 | 4036 | |
| 4 | 00 | 0012 | 0531 | 1 | 64 | 0000 | 0000 |
| 5 | 00 | 0667 | 0516 | 2 | 05 | 4703 | 0251 |
| 6 | 00 | 0667 | 0536 | 3 | 00 | 0704 | 0251 |
| 7 | 00 | 0670 | 0552 | 4 | −03 | 2710 | 4000 |
| 0500 | 10 | 0500 | 0217 | 5 | 00 | 0253 | 4253 |
| 1 | 24 | 0140 | 0140 | 6 | 74 | 0533 | 0000 |
| 2 | 16 | 0701 | 7 | 05 | 4000 | 0000 | |
| 3 | 15 | 0701 | 40 | −03 | 0253 | 0026 | |
| 4 | 64 | 0000 | 0002 | 1 | 00 | 0033 | 4033 |
| 5 | 05 | 6701 | 0026 | 2 | −03 | 0253 | 0253 |
| 6 | 05 | 6702 | 0027 | 3 | −02 | 0252 | 4000 |
| 7 | 64 | 0000 | 0001 | 4 | 00 | 0032 | 4032 |
| 0510 | 05 | 4000 | 2030 | 5 | 02 | 0252 | 0253 |
| 1 | 74 | 0510 | 0010 | 6 | 15 | 0001 | 0253 |
| 2 | 64 | 0000 | 0001 | 7 | 15 | 4000 | 0252 |
| 3 | 00 | 0027 | 0026 | 550 | 00 | 4650 | 0515 |
| 4 | 64 | 0000 | 0000 | 1 | 01 | 4666 | 0534 |
| 5 | 00 | 2710 | 0252 | 2 | 74 | 0513 | 0000 |
| 6 | 74 | 0515 | 0000 | 3 | 64 | 0000 | 0001 |
| 7 | 00 | 0252 | 0031 | 4 | 02 | 0031 | 2032 |
| 0520 | −03 | 0252 | 0026 | 5 | 74 | 0554 | 0006 |
| 1 | 00 | 0034 | 4034 | 6 | 05 | 4034 | 0026 |
| 2 | −03 | 0252 | 0026 | 7 | 03 | 0026 | 0026 |
| 3 | 03 | 0026 | 4251 | 60 | −01 | 0026 | 0035 |
| 4 | 00 | 0035 | 4035 | 1 | 10 | 0000 | 2672 |
| 5 | 03 | 0026 | 0251 | 2 | 05 | 4034 | 2673 |
| 6 | 00 | 0036 | 4036 | 3 | 05 | 4032 | 2676 |
| 4 | −03 | 0034 | 0035 | 7 | 05 | 6662 | 0551 |
| 5 | 03 | 0706 | 4030 0630 | 74 | 0505 | 0002 | |
| 6 | +03 | 0026 | 0034 | 1 | 15 | 0004 | 0672 |
| 7 | −03 | 0705 | 4000 | 2 | 06 | 4317 | 0514 |
| 570 | −00 | 0036 | 4000 | 3 | 06 | 4317 | 0516 |
| 1 | 01 | 0030 | 4031 | 4 | 06 | 4317 | 0531 |
| 2 | −03 | 2672 | 2672 | 5 | 00 | 4665 | 0532 |
| 3 | 03 | 2672 | 4677 | 6 | 00 | 4665 | 0533 |
| 4 | 02 | 0677 | 0031 | 7 | 06 | 4317 | 0536 |
| 5 | −03 | 2673 | 0036 | 40 | 06 | 4317 | 0552 |
| 6 | 03 | 0707 | 4027 | 1 | 05 | 4673 | 0026 |
| 7 | −03 | 0026 | 0026 | 2 | 03 | 0675 | 0026 |
| 0600 | −03 | 0706 | 4000 | 3 | −01 | 0026 | 0033 |
| 1 | +00 | 0027 | 4027 | 4 | −02 | 0672 | 4000 |
| 2 | −03 | 0705 | 4030 | 5 | 02 | 0674 | 4026 |
| 3 | +03 | 2673 | 4000 | 6 | 64 | 0000 | 0002 |
| 4 | −00 | 0037 | 4000 | 7 | 03 | 2673 | 2673 |
| 5 | −01 | 0027 | 4000 | 50 | 01 | 2673 | 0700 |
| 6 | −02 | 0677 | 4000 | 1 | 10 | 0700 | 0027 |
| 7 | −02 | 2672 | 4000 | 2 | 02 | 2672 | 0027 |
| 0610 | +01 | 0706 | 4030 | 3 | 05 | 4476 | 0700 |
| 1 | 15 | 0002 | 0030 | 4 | 15 | 0002 | 0026 |
| 0612 | 60 | 4000 | 0000 | 5 | 74 | 0647 | 0002 |
| 3 | 01 | 4012 | 0514 | 6 | 37 | 4000 | 0000 |
| 4 | 00 | 4667 | 0514 0657 | 00 | 2710 | 0252 | |
| 5 | 00 | 4671 | 0516 0660 | −03 | 2710 | 4000 | |
| 6 | 01 | 4012 | 0531 | 1 | 00 | 4011 | 0515 |
| 7 | 00 | 4667 | 0531 | 2 | 01 | 4011 | 0534 |
| 0 | 01 | 4014 | 0532 | 3 | 00 | 4666 | 0515 |
| 21 | 01 | 4014 | 0533 | 4 | 01 | 4666 | 0534 |
| 2 | 05 | 4657 | 0515 | 5 | 00 | 0004 | 0000 |
| 3 | 05 | 4660 | 0534 | 6 | 00 | m | 0000 |
| 4 | 00 | 4671 | 0536 | 7 | 00 | 0000 | m |
| 5 | 00 | 4671 | 0552 0670 | 00 | 0000 | n | |
| 6 | 05 | 6661 | 0550 | 1 | 00 | 0000 | n−m |
REFERENCES
-
I. V. Dunin-Barkovskii and N. V. Smirnov. Probability Theory and Mathematical Statistics. “Nauka,” Moscow, 1969.
-
V. D. Del’, G. L. Kalinichenko, V. A. Mal’tsev. Automation of programming for the “Minsk-1” digital computer by the method of interpreting systems. Tomsk, 1969.