Search Results for ""
571 - 580 of 1759 for Simple Random WalkSearch Results
Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...
A joint distribution function is a distribution function D(x,y) in two variables defined by D(x,y) = P(X<=x,Y<=y) (1) D_x(x) = lim_(y->infty)D(x,y) (2) D_y(y) = ...
A matrix each of whose elements is a variate. These variates need not be independent, and if they are not, a correlation is said to exist between them.
A triple (S,S,P) on the domain S, where (S,S) is a measurable space, S are the measurable subsets of S, and P is a measure on S with P(S)=1.
Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube I=[0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...
A quantity (such as a statistical median, quartile deviation, etc.), which is calculated from observed data.
The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...
There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...
The Gosset graph is a 27-regular graph on 56 vertices which is the skeleton of the Gosset polytope 3_(21). It is a distance-regular graph with intersection array ...
A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...
...
View search results from all Wolfram sites (40119 matches)

