Because the symmetric group on n elements has size n!

Let k samples each of size n be drawn at random.

Populations are fixed at size N and they will not go extinct.

Below, the size n refers to the number of digits of precision at which the function is to be evaluated.

An array of size N is indexed by integers from 0 up to and including N-1.

After that, it continues choosing random neighboring edges until a sub-graph of size n is obtained.

For sets of size n, there are n endofunctions on the set.

Using a sample of size n denote the points in the sample as .

Suppose we have a random sample of size n from a population, .

Two vertices are connected by an edge if the unigrams appear within a window of size N in the original text.