Search Results for ""

Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...

A shuffling algorithm used in a class of random number generators.

A random polygon containing the origin (Kovalenko 1999).

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

A slightly archaic term for a computer-generated random number. The prefix pseudo- is used to distinguish this type of number from a "truly" random number generated by a ...

Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...

First-passage percolation is a time-dependent generalization of discrete Bernoulli percolation in which each graph edge e of Z^d is assigned a nonnegative random variable ...

A lottery in which three numbers are picked at random from the integers 1-14.

Triangle picking is the process of picking triangles at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a random ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...