TOPICS
Search

Search Results for ""


101 - 110 of 1759 for Simple Random WalkSearch Results
A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...
A sequence of random variates X_0, X_1, ... is called absolutely fair if for n=1, 2, ..., <X_1>=0 and <X_(n+1)|X_1,...,X_n>=0 (Feller 1971, p. 210).
Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...
The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...
The robustness of a given outcome to small changes in initial conditions or small random fluctuations. Chaos is an example of a process which is not stable.
The z-score associated with the ith observation of a random variable x is given by z_i=(x_i-x^_)/sigma, where x^_ is the mean and sigma the standard deviation of all ...
A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...
Stochastic is synonymous with "random." The word is of Greek origin and means "pertaining to chance" (Parzen 1962, p. 7). It is used to indicate that a particular subject is ...
In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...
Ball triangle picking is the selection of triples of points (corresponding to vertices of a general triangle) randomly placed inside a ball. n random triangles can be picked ...
1 ... 8|9|10|11|12|13|14 ... 176 Previous Next

...