In statistics a random number is a single observation (outcome) of a specified random variable. Where no distribution is specified, the continuous uniform distribution on the interval [0,1] is usually intended.
In an informal sense, there is some circularity in this definition as the idea of random variable itself rests on the concept of randomness. A number itself cannot be random except in the sense of how it was generated. Informally, to generate a random number means that before it was generated, all elements of some set were equally probable as outcomes. In particular, this means that knowledge of earlier numbers generated by this process, or some other process, do not yield any extra information about the next number. This is equivalent to statistical independence.
| Table of contents |
|
2 Reliable sources of random numbers 3 Sources that approximate random numbers 4 Testing random numbers 5 External Links |
Statistical practice is based on statistical theory which, itself, if founded on the concept of randomness. Many elements of statistical practice depend on the emulation of randomness through random numbers. Where those random numbers fall short of the conceptual ideal of randomness any subsequent statistical analysis may suffer from bias. Elements of statistical practice that depend on randomness include: choosing a representative sample, disguising the protocol of a study from a participant (see randomized controlled trial) and Monte Carlo
simulation.
Randomness is also important in other activities such as cryptography and gambling.
Tables of random numbers have the desired properties no matter how chosen from the table: by row, column, diagonal or irregularly. Originally generated by hand, they are now, more commonly, the tabulated outputs of hardware random number generators. An important 20th century work was the RAND Corporation million-number table. It was produced in the 1950's by an electronic simulation of a roulette wheel attached to a computer, the results of which were then carefully filtered and tested before being used to generate the table. The RAND table was an important break-through in delivering random numbers because such a large and carefully prepared table had
never before been available. The filtering and testing process removes any bias or asymmetry from the hardware-generated numbers so that tables provide the most reliable random numbers.
Some physical phenomena, such as thermal noise in zener diodes appear to be truly random and can be used as the basis for hardware random number generators. However, many mechanical phenomena feature asymmetries and biases that make their outcomes not truly random. The many successful attempts to expoilt such phenomena by gamblers, especially in roulette and blackjack are testimony to these effects.
Pseudo-random number generators are algorithms that can automatically create long runs (up to millions of numbers) with good random properties but eventually the sequence repeats exactly.
They are very useful in developing Monte Carlo simulations as debugging is faciliated by the ability to run the same sequence of random numbers again by starting from the same seed. They are also used in cryptography so long as the seed is secret. Sender and
receiver can generate the same set of numbers automatically to use as keys.
Many mechanical methods of generating random numbers tend to be unreliable.Hardware random number generators need much care is needed in adequate mixing and checking randomness before use.
A variety of hypothesis tests are used in checking random numbers including:
Importance of random numbers
Reliable sources of random numbers
Tables of random numbers
Hardware random-number generators
Sources that approximate random numbers
Pseudo-random numbers
Hardware random-number generators
Testing random numbers
The null hypothesis of such tests is always that of randomness so we are principally interested in the nature of their type II errors which are typically difficult to quantify.
