Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Random mapping

From Encyclopedia of Mathematics - Reading time: 1 min


$\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$.

References[edit]

[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) | Licensed under CC BY-SA 3.0. Source: https://encyclopediaofmath.org/wiki/Random_mapping
21 views | Status: cached on November 21 2024 18:50:00
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF