Search Results for ""

The cumulative frequency in a frequency distribution divided by the total number of data points.

A function f(x) is said to be square integrable if int_(-infty)^infty|f(x)|^2dx is finite.

For a subgroup H of a group G, the index of H, denoted (G:H), is the cardinal number of the set of left cosets of H in G (which is equal to the cardinal number of the set of ...

The two-dimensional map x_(n+1) = [x_n+nu(1+muy_n)+epsilonnumucos(2pix_n)] (mod 1) (1) y_(n+1) = e^(-Gamma)[y_n+epsiloncos(2pix_n)], (2) where mu=(1-e^(-Gamma))/Gamma (3) ...

A box-and-whisker plot (sometimes called simply a box plot) is a histogram-like method of displaying data, invented by J. Tukey. To create a box-and-whisker plot, draw a box ...

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...