Random mapping

From Encyclopedia of Mathematics
Jump to: navigation, search

$\sigma$ of a set $X = \{1,2,\ldots,n\}$ into itself

A random variable taking values in the set $\Sigma_n$ of all single-valued mappings of $X$ into itself. The random mappings $\sigma$ for which the probability $\mathsf{P}\{\sigma=s\}$ is positive only for one-to-one mappings $s$ are called random permutations of degree (order) $n$. The most thoroughly studied random mappings are those for which $\mathsf{P}\{\sigma=s\} = n^{-n}$ for all $s \in\Sigma_n$. A realization of such a random mapping is the result of a simple random selection from $\Sigma_n$.


[1] V.F. Kolchin, "Random mappings" , Optim. Software (1986) (Translated from Russian) Zbl 0605.60010
How to Cite This Entry:
Random mapping. Encyclopedia of Mathematics. URL:
This article was adapted from an original article by V.F. Kolchin (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article