Random Function

Also found in: Wikipedia.

random function

[′ran·dəm ′fəŋk·shən]
A function whose domain is an interval of the extended real numbers and has range in the set of random variables on some probability space; more precisely, a mapping of the cartesian product of an interval in the extended reals with a probability space to the extended reals so that each section is a random variable.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
The following article is from The Great Soviet Encyclopedia (1979). It might be outdated or ideologically biased.

Random Function


If a function of an arbitrary argument t is defined on the set T of the values of t and assumes numerical values or, more generally, values from some vector space, the function is said to be a random function if its values are determined by some trial and can differ depending on the outcome of the trial. It is also required that there exist a definite probability distribution function for the values. If the set T is finite, the random function is a finite set of random variables; this set can be regarded as a single random vector quantity.

The most thoroughly studied random function with an infinite T is the important special case where t assumes numerical values and is time. The random function X(t) in this case is called a stochastic process; when t assumes only integral values, the terms “random sequence” and “time series” are also sometimes applied to X(t). If the values of t are points in some region of a multidimensional space, the random function is called a random field. Typical examples of random functions that are not stochastic processes are the velocity, pressure, and temperature fields of a turbulent flow of a liquid or gas and the height z of the agitated surface of the sea or the surface of an artificial rough plate.

The mathematical theory of random functions coincides with the theory of probability distribution functions in the function space of the values of X(t). These distribution functions can be specified by the set of finite-dimensional probability distribution functions for the sets of random variables X(t1), X(t2), …, X(tn) corresponding to all possible finite subsets (t1, t2,…, tn) of points of T. Alternatively, the distribution functions can be specified by the characteristic functional of the random function X(t); this characteristic functional is the mathematical expectation of the random variable il[X(t)], where l[X(t)] is a linear functional of X(t) of general form. Much progress has been made in the theory of homogeneous random fields, which are a special class of random functions; this class is a generalization of the class of stationary stochastic processes.


Vybrosy sluchainykh polei: Sb. st. Moscow, 1972.
Yaglom (Iaglom), A. M. “Second-order Homogeneous Random Fields.” In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, vol. 2. Berkeley-Los Angeles, 1961.
Whittle, P. “Stochastic Processes in Several Dimensions.” Bulletin of the Institute of Statistics, 1963, vol. 40.


The Great Soviet Encyclopedia, 3rd Edition (1970-1979). © 2010 The Gale Group, Inc. All rights reserved.
References in periodicals archive ?
Many researches on NIZK have been proposed to improve its efficiency, for example, from the earlier work, such as the Fiat-Shamir heuristic [14] where the cryptographic hash function is introduced as a random function; recent works such as Lindell's transform of non-programmable random oracle (NPRO) model [15] that needs no random oracles to achieve efficient NIZK arguments in the common reference string (CRS) model, and Ciampi's work [16] which combines each own's advantage of both without a random oracle.
DCF algorithm utilized the random function in the binary exponential backoff algorithm to produce the values of backoff.
The right-hand side of (1), F(t), is assumed to be a time-dependent random function that depends linearly on [[omega].sub.2] and expressed by
In this paper, the method of decomposing data by random function is proposed.
For a random function f : [[0, [infinity]).sub.T] x [OMEGA] [right arrow] R we define the extension [??] : [0, [infinity]) x [OMEGA] [right arrow] R by
The pattern generator selects at random pattern by using a random function with various rules given.
Liu, "Simulation of stochastic ocean states by random function methods," Journal of Vibration and Shock, vol.
An example for such random function f (i, j) to generate the Metadata M is
All the valid lottery tickets and the winning numbers must be verified via a verifiable random function.
As it is well known, a random field [PHI](x) is a 2-dimensional, real-valued random function. The function [PHI](x) is called macroscopically homogeneous (or stationary in the strict sense), if [PHI](x) is invariant with respect to translations, i.e., its finite-dimensional distributions are translation invariant.