Search Results for ""

Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

If F(x) is a probability distribution with zero mean and rho=int_(-infty)^infty|x|^3dF(x)<infty, (1) where the above integral is a stieltjes integral, then for all x and n, ...

Given a set S with a subset E, the complement (denoted E^' or E^_) of E with respect to S is defined as E^'={F:F in S,F not in E}. (1) Using set difference notation, the ...

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

The Maxwell (or Maxwell-Boltzmann) distribution gives the distribution of speeds of molecules in thermal equilibrium as given by statistical mechanics. Defining a=sqrt(kT/m), ...

The h-statistic h_r is the unique symmetric unbiased estimator for a central moment of a distribution <h_r>=mu_r. (1) In addition, the variance var(h_r)=<(h_r-mu_r)^2> (2) is ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

A k-automatic set is a set of integers whose base-k representations form a regular language, i.e., a language accepted by a finite automaton or state machine. If bases a and ...