Search Results for ""

A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...

A random variate is a variable generated from uniformly distributed pseudorandom numbers. Depending on how they are generated, a random variate can be uniformly or ...

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

Random walk trajectories which are composed of self-similar jumps. They are described by the Lévy distribution.

A limiting value of a holonomic function near a singular point. Holonomic constants include Apéry's constant, Catalan's constant, Pólya's random walk constants for d>2, and ...

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

A statistical distribution in which the variates occur with probabilities asymptotically matching their "true" underlying statistical distribution is said to be random.

A random graph is a graph in which properties such as the number of graph vertices, graph edges, and connections between them are determined in some random way. The graphs ...

A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...