method = name or method = list -- This option can be used to select a method of generating the sample. There are four main choices: method = default, method = custom, method = discrete, and method = envelope. One can supply method-specific options by instead specifying a list, the first element of which is one of the names default, custom, discrete, and envelope, and the other elements are equations; for example, method = [envelope, updates=20, range=0..100]. These method-specific options will be explained below.

method = envelope uses an implementation of acceptance/rejection generation with an adaptive piecewise linear envelope, applicable to continuous distributions. This implementation will only work for distributions where on its support, the PDF is twice differentiable, has a continuous first derivative, and has only finitely many inflection points. There are three valid method-specific options: range, basepoints, and updates.

range: The (finite) range over which the piecewise linear envelope is to be defined, and consequently where the samples are to be found. If range = deduce (the default), then Maple takes the range given by the $\mathrm{\epsilon }$ and $1-\mathrm{\epsilon }$ Quantiles of the distribution, for some small positive value of $\mathrm{\epsilon }$ that depends on the value of Digits. Otherwise, range should be a range of two real numbers, such as range = 0 .. 1.

basepoints: The base points are the boundaries between the segments of the piecewise linear envelope, which should include all inflection points of the PDF of the distribution. If basepoints = deduce (the default), then Maple attempts to find all inflection points itself. Otherwise, basepoints should be a list of floating point real numbers which includes all inflection points.

updates: The envelope is automatically refined as more numbers are generated; the maximal number of segments is given by this option, which should be a positive integer. The default value is $100$.

method = discrete uses an implementation of the alias method by Walker (see references below), applicable to discrete distributions. Because this method computes and stores the individual probabilities for all possible outcomes within the range (see below), it may be inefficient for distributions with very heavy tails. There is one method-specific option: range.

range: The (finite) range of integers for which the probabilities are computed. If the distribution uses the DiscreteValueMap feature (this is the case if the distribution can attain non-integer values), then this describes the range of source values; the map is applied to these integers to obtain the resulting values.

method = custom uses a distribution-specific method. Almost all predefined distributions have a highly efficient custom implementation in external C code. Method-specific options are all ignored.

method = default (which is the default) selects one of the other three methods. For most built-in distributions, it selects method = custom. For other distributions, such as custom-defined ones, the system falls back to either using method = envelope (for continuous distributions) or using method = discrete (for discrete distributions). The method-specific options accepted are the same as for the applicable fallback method, and they are only used in case the system falls back to that generator.

If X is an algebraic expression involving multiple random variables, say $R_1$ and $R_2$, then one can specify different sample generation methods for $R_1$ and $R_2$ by using options ${\mathrm{method}}_{R_1}={\mathrm{generator}}_1$ and ${\mathrm{method}}_{R_2}={\mathrm{generator}}_2$, where ${\mathrm{generator}}_1$ and ${\mathrm{generator}}_2$ are sample generation methods that could be validly specified as $\mathrm{method}={\mathrm{generator}}_i$. If a random variable-specific sample generation method is given only for some of the random variables, the others will use the method given by the $\mathrm{method}=\mathrm{...}$ option, or default if no such option is present.

When implementing an algorithm that uses a large number of random samples, it can be worthwhile to think about efficiency of the random sample generation. In most cases, the best efficiency is achieved when all samples are generated at once in a preprocessing phase and stored in a Vector (using the first calling sequence, above), and the values are then used one by one in the algorithm.

In some cases, however, this is not possible. For example, this might take too much memory (if a very large number of samples is needed), it might be difficult or impossible to predict the number of samples needed, or the parameters of the random variable might change during the algorithm. In the first two cases, the recommended strategy is to use the fourth calling sequence to create a procedure p, then use p to create a Vector that can hold a large number of samples (using, say, $v≔p\left({10}^5\right)$), using the elements of v one by one, and calling $p\left(v\right)$ to refill v when the samples run out. If the parameters of the random variable keep changing, then one can define the random variable with parameters that are unassigned initially, use the fourth calling sequence to create a procedure p, then assign values to the parameters afterwards. An example is provided below.

For some of the discrete distributions, the method selected by default is not method = custom but method = discrete. For these distributions, this method is faster when generating more than about 1000 random numbers. If you need to generate fewer random numbers, you can select method = custom by including that option explicitly.

The Sample command generates a random sample drawn from the distribution given by X.

The first parameter, X, can be a distribution (see Statistics[Distribution]), a random variable, or an algebraic expression involving random variables (see Statistics[RandomVariable]).

In the first calling sequence, the second parameter, n, is the sample size. This calling sequence will return a newly created Vector of length n, filled with the sample values. This calling sequence, or one of the next two, is recommended for all cases where there are no great performance concerns.

In the second calling sequence, the second parameter, m, is a list of two nonnegative integers. This calling sequence will return a newly created Matrix with the specified dimensions, filled with the sample values.

In the third calling sequence, the second parameter, rng, is a range or a list of ranges determining the dimensions of an Array. This Array will be created, filled with the sample values, and returned.

In the fourth calling sequence, the second parameter, out, is an rtable (such as a Vector) that was created beforehand. Upon successful return of the Sample command, out will have been filled with the sample values.

out needs to have rectangular storage and the float data type that is consistent with the current settings of Digits and UseHardwareFloats. That is, if either UseHardwareFloats = true, or UseHardwareFloats = deduced and Digits <= evalhf(Digits) (which is the default), then out needs to have datatype = float[8]; in the other case, that is, if either UseHardwareFloats = false, or UseHardwareFloats = deduced and Digits > evalhf(Digits), then out needs to have datatype = sfloat. This can easily be achieved by supplying the option datatype = float to the rtable creation function; this will automatically select the correct data type for the current settings.

In the fourth calling sequence, Sample returns a procedure p, which can subsequently be called to generate samples of X repeatedly. The procedure p accepts a single argument, which can be n, m, rng, or out, and then behaves as if one of the first three calling sequences were called. p does not accept options; any options should be given in the call to Sample itself.

$\mathrm{with}\left(\mathrm{Statistics}\right)\&colon;$

$X≔\mathrm{RandomVariable}\left(\mathrm{Normal}\left(0\&comma;1\right)\right)$

$X≔\mathrm{\_R}$

$A≔\mathrm{Sample}\left(X\&comma;{10}^6\right)\&colon;$

$P≔\mathrm{DensityPlot}\left(X\&comma;\mathrm{range}=-2..2\&comma;\mathrm{thickness}=3\&comma;\mathrm{color}=\mathrm{red}\right)\&colon;$

$Q≔\mathrm{Histogram}\left(A\&comma;\mathrm{range}=-2..2\right)\&colon;$

$\mathrm{plots}\left[\mathrm{display}\right]\left(P\&comma;Q\right)$

$Y≔\mathrm{RandomVariable}\left(\mathrm{Normal}\left(0\&comma;1\right)\right)$

$Y≔\mathrm{\_R0}$

$B≔\mathrm{Sample}\left(\frac{X}{Y}\&comma;{10}^6\right)\&colon;$

$P≔\mathrm{DensityPlot}\left(\mathrm{Cauchy}\left(0\&comma;1\right)\&comma;\mathrm{range}=-2..2\&comma;\mathrm{thickness}=3\&comma;\mathrm{color}=\mathrm{red}\right)\&colon;$

$Q≔\mathrm{Histogram}\left(B\&comma;\mathrm{range}=-2..2\right)\&colon;$

$\mathrm{plots}\left[\mathrm{display}\right]\left(P\&comma;Q\right)$

$\mathrm{dist}≔\mathrm{Distribution}\left(\mathrm{`=`}\left(\mathrm{PDF}\&comma;t\mapsto \mathrm{piecewise}\left(t<0\&comma;0\&comma;t<1\&comma;\frac{36\cdot t^2\cdot \left(\frac{4}{3}-t\right)}{7}\&comma;0\right)\right)\right)$

$\mathrm{dist}≔\mathbf{module}\left(\right)\mathbf{option}\mathrm{Distribution}\&comma;\mathrm{Continuous}\&semi;\mathbf{export}\mathrm{PDF}\&comma;\mathrm{Conditions}\&semi;\mathbf{end\; module}$

$B≔\mathrm{Sample}\left(\mathrm{RandomVariable}\left(\mathrm{dist}\right)\&comma;{10}^6\right)\&colon;$

$P≔\mathrm{DensityPlot}\left(\mathrm{dist}\&comma;\mathrm{range}=0..1\&comma;\mathrm{thickness}=3\&comma;\mathrm{color}=\mathrm{red}\right)\&colon;$

$Q≔\mathrm{Histogram}\left(B\right)\&colon;$

$\mathrm{plots}\left[\mathrm{display}\right]\left(P\&comma;Q\right)$

$a≔\mathrm{Sample}\left(\frac{X}{Y}\&comma;\left[1..1000\&comma;1..1000\right]\right)$

$m≔\mathrm{Sample}\left(\frac{X}{Y}\&comma;\left[3\&comma;3\right]\right)$

$m≔\left[\begin{array}{ccc}1.73381095915784& 0.619445146766988& \mathrm{-4.38544454374716}\\ \mathrm{-3.65149550630508}& \mathrm{-0.940625211071576}& 1.15063333773690\\ \mathrm{-6.27347263502003}& 2.04859402579226& \mathrm{-0.234438105073932}\end{array}\right]$

$\mathrm{s1}≔\mathrm{Sample}\left(\frac{X}{Y}\&comma;{10}^6\&comma;\mathrm{method}=\left[\mathrm{envelope}\&comma;\mathrm{range}=0..1\right]\right)$

$\mathrm{Histogram}\left(\mathrm{s1}\&comma;\mathrm{range}=0..10\right)$

$\mathrm{s2}≔\mathrm{Sample}\left(\frac{X}{Y}\&comma;{10}^6\&comma;\mathrm{method}\left[X\right]=\left[\mathrm{envelope}\&comma;\mathrm{range}=0..1\right]\right)$

$\mathrm{Histogram}\left(\mathrm{s2}\&comma;\mathrm{range}=-10..10\right)$

$\mathrm{Sample}\left(\mathrm{Cauchy}\left(0\&comma;1\right)\&comma;\mathrm{s2}\right)$

$\mathrm{Histogram}\left(\mathrm{s2}\&comma;\mathrm{range}=-10..10\right)$

$p≔\mathrm{Sample}\left(X\right)$

$p≔\mathbf{proc}\left(n::\mathrm{Sample}:-\mathrm{sizeType}\right)...\mathbf{end\; proc}$

$p\left(\mathrm{s2}\right)$

$\mathrm{Histogram}\left(\mathrm{s2}\right)$

$\mathrm{dist2}≔\mathrm{Distribution}\left(\mathrm{Type}=\mathrm{discrete}\&comma;\mathrm{`=`}\left(\mathrm{ProbabilityFunction}\&comma;t\mapsto 2^{-\log \left[\frac{3}{2}\right]\left(t\right)}\right)\&comma;\mathrm{`=`}\left(\mathrm{DiscreteValueMap}\&comma;n\mapsto {\left(\frac{3}{2}\right)}^n\right)\&comma;\mathrm{Support}=1..\mathrm{\infty }\right)$

$\mathrm{dist2}≔\mathbf{module}\left(\right)\mathbf{option}\mathrm{Distribution}\&comma;\mathrm{Discrete}\&semi;\mathbf{export}\mathrm{Conditions}\&comma;\mathrm{DiscreteValueMap}\&comma;\mathrm{Support}\&comma;\mathrm{ProbabilityFunction}\&semi;\mathbf{end\; module}$

$s≔\mathrm{Sample}\left(\mathrm{dist2}\&comma;{10}^5\right)$

$\mathrm{sort}\left(\mathrm{Tally}\left(s\right)\right)$

$\left[1.50000000000000=49901\&comma;2.25000000000000=25074\&comma;3.37500000000000=12482\&comma;5.06250000000000=6226\&comma;7.59375000000000=3128\&comma;11.3906250000000=1618\&comma;17.0859375000000=772\&comma;25.6289062500000=379\&comma;38.4433593750000=226\&comma;57.6650390625000=89\&comma;86.4975585937500=47\&comma;129.746337890625=26\&comma;194.619506835938=17\&comma;291.929260253906=8\&comma;437.893890380859=4\&comma;985.261253356934=1\&comma;7481.82764267921=2\right]$

$X≔\mathrm{RandomVariable}\left(\mathrm{Exponential}\left(\mathrm{\lambda }\right)\right)$

$X≔\mathrm{\_R6}$

$p≔\mathrm{Sample}\left(X\right)$

$p≔\mathbf{proc}\left(n::\mathrm{Sample}:-\mathrm{sizeType}\right)...\mathbf{end\; proc}$

$p\left(1\right)$

Error, (in p) unable to evaluate lambda to floating-point

$\mathrm{\lambda }≔1$

$\mathrm{\lambda }≔1$

$N≔{10}^3$

$N≔1000$

$v≔\mathrm{Vector}\left(N\&comma;'\mathrm{datatype}'='\mathrm{float}'\right)$

$$\begin{gathered} \mathbf{for}i\mathbf{to}N\mathbf{do} \\ v\left[i\right]≔p\left(1\right)\left[1\right]; \\ \mathrm{\lambda }≔\mathrm{sqrt}\left(v\left[i\right]\right) \\ \mathbf{end}\mathbf{do}\&colon; \end{gathered}$$

$\mathrm{plots}\left[\mathrm{pointplot}\right]\left(⟨v\left[..-2\right]|v\left[2..\right]⟩\&comma;\mathrm{axis}=\left[\mathrm{mode}=\log \right]\&comma;\mathrm{symbolsize}=1\&comma;\mathrm{color}=\mathrm{red}\right)$

Stuart, Alan, and Ord, Keith. Kendall's Advanced Theory of Statistics. 6th ed. London: Edward Arnold, 1998. Vol. 1: Distribution Theory.

Walker, Alastair J. New Fast Method for Generating Discrete Random Numbers with Arbitrary Frequency Distributions, Electronic Letters, 10, 127-128.

Walker, Alastair J. An Efficient Method for Generating Discrete Random Variables with General Distributions, ACM Trans. Math. Software, 3, 253-256.

The rng and out parameters were introduced in Maple 15.

The method option was introduced in Maple 15.

For more information on Maple 15 changes, see Updates in Maple 15.

The m parameter was introduced in Maple 16.

The method option was updated in Maple 16.

For more information on Maple 16 changes, see Updates in Maple 16.