Search Results for ""

alpha(x) = 1/(sqrt(2pi))int_(-x)^xe^(-t^2/2)dt (1) = sqrt(2/pi)int_0^xe^(-t^2/2)dt (2) = 2Phi(x) (3) = erf(x/(sqrt(2))), (4) where Phi(x) is the normal distribution function ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

Given a subset A of a larger set, the characteristic function chi_A, sometimes also called the indicator function, is the function defined to be identically one on A, and is ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...

Let S be partitioned into r×s disjoint sets E_i and F_j where the general subset is denoted E_i intersection F_j. Then the marginal probability of E_i is ...

Probability and Statistics

Define T as the set of all points t with probabilities P(x) such that a>t=>P(a<=x<=a+da)<P_0 or a<t=>P(a<=x<=a+da)<P_0, where P_0 is a point probability (often, the ...

The portion of the probability distribution which has a P-value equal to the observed P-value.

The conditional probability of an event A assuming that B has occurred, denoted P(A|B), equals P(A|B)=(P(A intersection B))/(P(B)), (1) which can be proven directly using a ...