Search Results for ""

Probability and Statistics

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

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 ...

The orthogonal decomposition of a vector y in R^n is the sum of a vector in a subspace W of R^n and a vector in the orthogonal complement W^_|_ to W. The orthogonal ...

A semialgebraic set is a subset of R^n which is a finite Boolean combination of sets of the form {x^_=(x_1,...,x_n):f(x^_)>0} and {x^_:g(x^_)=0}, where f and g are ...

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

The Wolstenholme numbers are defined as the numerators of the generalized harmonic number H_(n,2) appearing in Wolstenholme's theorem. The first few are 1, 5, 49, 205, 5269, ...

The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...

Let W(u) be a Wiener process. Then where V_t=f(W(t),tau) for 0<=tau=T-t<=T, and f in C^(2,1)((0,infty)×[0,T]). Note that while Ito's lemma was proved by Kiyoshi Ito (also ...

A set which is connected but not simply connected is called multiply connected. A space is n-multiply connected if it is (n-1)-connected and if every map from the n-sphere ...