Search Results for ""
71 - 80 of 207 for randomnessSearch Results
A set of positive integers S is called sum-free if the equation x+y=z has no solutions x, y, z in S. The probability that a random sum-free set S consists entirely of odd ...
A random process whose future probabilities are determined by its most recent values. A stochastic process x(t) is called Markov if for every n and t_1<t_2...<t_n, we have ...
A variable x is memoryless with respect to t if, for all s with t!=0, P(x>s+t|x>t)=P(x>s). (1) Equivalently, (P(x>s+t,x>t))/(P(x>t)) = P(x>s) (2) P(x>s+t) = P(x>s)P(x>t). (3) ...
Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...
Place 2n balls in a bag and number them 1 to 2n, then pick half of them at random. The number of different possible sums for n=1, 2, 3, ... are then 2, 5, 10, 17, 26, ... ...
Consider the average volume of a tetrahedron picked at random inside an octahedron of unit volume. The answer is difficult to compute analytically (Zinani 2003), but the mean ...
Doob (1996) defines a stochastic process as a family of random variables {x(t,-),t in J} from some probability space (S,S,P) into a state space (S^',S^'). Here, J is the ...
A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...
In statistics, a trial is a single performance of well-defined experiment (Papoulis 1984, p. 25), such as the flipping of a coin, the generation of a random number, the ...
Ball tetrahedron picking is the selection of quadruples of points (corresponding to vertices of a general tetrahedron) randomly placed inside a ball. n random tetrahedra can ...
...