Search Results for ""

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

Let f_1(z), ..., f_m(z) for m>=1 be a set of E-functions that (1) form a solution of the system of differential equations y_k^'=q_(k0)+sum_(j=1)^mq_(kj)y_j for q_(kj) in C(z) ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...

A dot placed under a symbol to indicate a dummy variable, e.g., c_._1 (Comtet 1974, p. 32). This notation, however, is not very common.

Algebra

Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...

The distribution of a variable is a description of the relative numbers of times each possible outcome will occur in a number of trials. The function describing the ...

A variate is a generalization of the concept of a random variable that is defined without reference to a particular type of probabilistic experiment. It is defined as the set ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...