Integer, Intent (In)	::	mode, n, m, k, lr, ldx
Integer, Intent (Inout)	::	state(*), x(ldx,k), ifail
Real (Kind=nag_wp), Intent (In)	::	p(k)
Real (Kind=nag_wp), Intent (Inout)	::	r(lr)

C Header Interface

#include nagmk26.h

void	g05tgf_ ( const Integer mode, const Integer n, const Integer m, const Integer k, const double p[], double r[], const Integer lr, Integer state[], Integer x[], const Integer ldx, Integer *ifail)

3

Description

g05tgf generates a sequence of

n

groups of

k

integers

x_{i, j}

, for

j = 1, 2, \dots, k

and

i = 1, 2, \dots, n

, from a multinomial distribution with

m

trials and

k

outcomes, where the probability of

x_{i, j} = I_{j}

for each

j = 1, 2, \dots, k

P (i_{1} = I_{1}, \dots, i_{k} = I_{k}) = \frac{m!}{\prod_{j = 1}^{k} I_{j}!} \prod_{j = 1}^{k} p_{j}^{I_{j}} = \frac{m!}{I_{1}! I_{2}! \dots I_{k}!} p_{1}^{I_{1}} p_{2}^{I_{2}} \dots p_{k}^{I_{k}},

where

\sum_{j = 1}^{k} p_{j} = 1 and \sum_{j = 1}^{k} I_{j} = m .

A single trial can have several outcomes (

k

) and the probability of achieving each outcome is known (

p_{j}

). After

m

trials each outcome will have occurred a certain number of times. The

k

numbers representing the numbers of occurrences for each outcome after

m

trials is then a single sample from the multinomial distribution defined by the parameters

k

m

and

p_{j}

, for

j = 1, 2, \dots, k

. This routine returns

n

such samples.

When

k = 2

this distribution is equivalent to the binomial distribution with parameters

m

and

p = p_{1}

(see g05taf).

The variates can be generated with or without using a search table and index. If a search table is used then it is stored with the index in a reference vector and subsequent calls to g05tgf with the same parameter values can then use this reference vector to generate further variates. The reference array is generated only for the outcome with greatest probability. The number of successes for the outcome with greatest probability is calculated first as for the binomial distribution (see g05taf); the number of successes for other outcomes are calculated in turn for the remaining reduced multinomial distribution; the number of successes for the final outcome is simply calculated to ensure that the total number of successes is

m

One of the initialization routines g05kff (for a repeatable sequence if computed sequentially) or g05kgf (for a non-repeatable sequence) must be called prior to the first call to g05tgf.

4

References

Knuth D E (1981) The Art of Computer Programming (Volume 2) (2nd Edition) Addison–Wesley

5

Arguments

1: $mode$ – IntegerInput

On entry: a code for selecting the operation to be performed by the routine.

$mode = 0$: Set up reference vector only.
$mode = 1$: Generate variates using reference vector set up in a prior call to g05tgf.
$mode = 2$: Set up reference vector and generate variates.
$mode = 3$: Generate variates without using the reference vector.

Constraint:

mode = 0

1

2

3

2: $n$ – IntegerInput

On entry:

n

, the number of pseudorandom numbers to be generated.

Constraint:

n \geq 0

3: $m$ – IntegerInput

On entry:

m

, the number of trials of the multinomial distribution.

Constraint:

m \geq 0

4: $k$ – IntegerInput

On entry:

k

, the number of possible outcomes of the multinomial distribution.

Constraint:

k \geq 2

5: $p (k)$ – Real (Kind=nag_wp) arrayInput

On entry: contains the probabilities

p_{j}

, for

j = 1, 2, \dots, k

, of the

k

possible outcomes of the multinomial distribution.

Constraint:

0.0 \leq p (j) \leq 1.0

and

\sum_{j = 1}^{k} p (j) = 1.0

6: $r (lr)$ – Real (Kind=nag_wp) arrayCommunication Array

On entry: if

mode = 1

, the reference vector from the previous call to g05tgf.

mode = 3

, r is not referenced.

On exit: if

mode \neq 3

, the reference vector.

7: $lr$ – IntegerInput

Note: for convenience p_max will be used here to denote the expression

p_max = \max_{j} (p (j))

On entry: the dimension of the array r as declared in the (sub)program from which g05tgf is called.

Suggested values:

if $mode \neq 3$ , $lr = 30 + 20 \times \sqrt{m \times p_max \times (1 - p_max)}$ ;
otherwise $lr = 1$ .

Constraints:

if $mode = 0$ or $2$ ,
$\begin{array}{l} lr & > & \min (m, INT [m \times p_max + 7.25 \times \sqrt{m \times p_max \times (1 - p_max)} + 8.5]) \\ - \max (0, INT [m \times p_max - 7.25 \times \sqrt{m \times p_max \times (1 - p_max)}]) + 9 \end{array}$ ;
if $mode = 1$ , lr must remain unchanged from the previous call to g05tgf.

8: $state (*)$ – Integer arrayCommunication Array

Note: the actual argument supplied must be the array state supplied to the initialization routines g05kff or g05kgf.

On entry: contains information on the selected base generator and its current state.

On exit: contains updated information on the state of the generator.

9: $x (ldx, k)$ – Integer arrayOutput

On exit: the first

n

rows of

x (i, j)

each contain

k

pseudorandom numbers representing a

k

-dimensional variate from the specified multinomial distribution.

10: $ldx$ – IntegerInput

On entry: the first dimension of the array x as declared in the (sub)program from which g05tgf is called.

Constraint:

ldx \geq n

11: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 ​ or ​ 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, if you are not familiar with this argument, the recommended value is

0

. When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $mode = 〈value〉$ .
Constraint: $mode = 0$ , $1$ , $2$ or $3$ .

$ifail = 2$: On entry, $n = 〈value〉$ .
Constraint: $n \geq 0$ .

$ifail = 3$: On entry, $m = 〈value〉$ .
Constraint: $m \geq 0$ .

$ifail = 4$: On entry, $k = 〈value〉$ .
Constraint: $k \geq 2$ .

$ifail = 5$: On entry, at least one element of the vector p is less than $0.0$ or greater than $1.0$ .

On entry, the sum of the elements of p do not equal one.

$ifail = 6$: On entry, some of the elements of the array r have been corrupted or have not been initialized.

The value of m or k is not the same as when r was set up in a previous call.
Previous value of $m = 〈value〉$ and $m = 〈value〉$ .
Previous value of $k = 〈value〉$ and $k = 〈value〉$ .

$ifail = 7$: On entry, lr is too small when $mode = 0$ or $2$ : $lr = 〈value〉$ , minimum length required $= 〈value〉$ .

$ifail = 8$: On entry, state vector has been corrupted or not initialized.

$ifail = 10$: On entry, $ldx = 〈value〉$ and $n = 〈value〉$ .
Constraint: $ldx \geq n$ .

$ifail = 210$: On entry, $ldx = 〈value〉$ and $k = 〈value〉$ .
Constraint: $ldx \geq k$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

Not applicable.

8

Parallelism and Performance

g05tgf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

The reference vector for only one outcome can be set up because the conditional distributions cannot be known in advance of the generation of variates. The outcome with greatest probability of success is chosen for the reference vector because it will have the greatest spread of likely values.

10

Example

This example prints

20

pseudorandom

k

-dimensional variates from a multinomial distribution with

k = 4

m = 6000

p_{1} = 0.08

p_{2} = 0.1

p_{3} = 0.8

and

p_{4} = 0.02

, generated by a single call to g05tgf, after initialization by g05kff.

NAG Library Routine Document

g05tgf (int_multinomial)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results