I have forgotten
my Password

Or login with:

  • Facebookhttp://facebook.com/
  • Googlehttps://www.google.com/accounts/o8/id
  • Yahoohttps://me.yahoo.com
this unit 4.99
sub units 5.10

Random Sample

Generates random numbers following a Chi-Square distribution.
Controller: CodeCogs

add cart





Class RandomSample

The chi-square distribution is a univariate distribution which results when univariate-normal variables are squared, and possibly summed. While the normal distribution is symmetric, the chi-square distribution is skewed to the right, and has a minimum of 0. The degrees of freedom of the resulting chi-square distribution are equal to the number of variables that are summed. The mean of a chi-square distribution is equal to its degrees of freedom, and the variance is equal to twice the degrees of freedom.

These chi-square distributions are themselves additive. That is, a chi-square-distributed variable with d_1 degrees of freedom can be added to one with d_2 degrees of freedom to yield a chi-square-distributed variable with d_1 + d_2 degrees of freedom, as long as the two added variables are independent. Analogous results can be obtained by subtraction, under the same condition.

The probability density function for the chi-square distribution with r degrees of freedom is given by

If some or all of the original normal variables had nonzero mean, then the result will be a noncentral chi-square distribution, with noncentrality parameter Q. The effect of the noncentrality parameter is to move the distribution to the right and to make it appear flatter and more symmetrical. Adding two independent noncentral chi-square distributed variables with noncentrality parameters Q_1 and Q_2yields a noncentral chi-square distributed variable with noncentrality parameter Q_1 + Q_2.

Using this class, the diagram below is generated from two distinct sequences of 1000 random numbers. Each pair of numbers are plotted against each other, to illustrate the Chi-Square behaviour of this non-uniform random number generator.



The average running time for generating 100,000,000 random numbers using this class on a 750MHz microprocessor is 76 seconds.


  • Ed Rigdon's structural equation modeling FAQ, http://www2.gsu.edu/~mkteer/semfaq.html
  • MathWorld, http://mathworld.wolfram.com/Chi-SquaredDistribution.html
  • The Newran03 random number generator library of Robert Davies, http://www.robertnz.net/nr03doc.htm

Example 1

The following example displays 40 random floating point numbers from a chi-square distribution. It uses two different generators to achieve this. The first generator uses a particular value to initialize the seed, while the second one is using the system timer. Notice that it was necessary to divide the timer with the MERSENNEDIV value in order to keep the seed in the (0, 1) interval. Since the seed of the first generator is never changed, the first 20 numbers will always remain the same. However since the second generator is initialized via the system timer, the next 20 numbers will obviously vary with each execution of the program,
#include <iostream>
#include <time.h>
#include <codecogs/stats/dists/continuous/chisquared/randomsample.h>
using namespace std;
int main() 
    Stats::Dists::Continuous::ChiSquared::RandomSample A(10, 12.57, 0.813);
    Stats::Dists::Continuous::ChiSquared::RandomSample B(13, 11.06, time(0) / MERSENNEDIV);
    for (int i = 0; i < 20; ++i)
        cout << A.genReal() << endl;
    cout << endl;
    for (int i = 0; i < 20; ++i)
        cout << B.genReal() << endl;
    return 0;
Below you will find 20 numbers corresponding to the output of the first generator :


Lucian Bentea
Source Code

Source code is available when you buy a Commercial licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.


doubles )
Constructor that sets up the class variables and initializes the associated random number generator with the given seed.


srandom number seed
Source Code

Source code is available when you buy a Commercial licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.


doubleseed = 0 )
This function is a simple wrapper around the randomsample class provided in this module. It uses a static to keep a single instance of this class, so that each call to this function returns a new random number. As a result this function is not necessarily thread safe, in the sense that with identical initial seed, the sequence of random numbers may differ on a multitasking or multi threaded system.

The seed is only set on the first call to this function. Thereafter this parameter is ignored. If you do no want to set the seed, then we suggest you use the system clock the first time you call this function, i.e.
#include <time.h>
sample(df, noncen, time(0) / MERSENNEDIV);
If you require more advance behaviour, we strongly recommend that directly use the underlying class randomsample that is provided with this module.

Graph is not currently available


dfdegree of freedom
seedsets the initial seed for the random generator. Only used in the first call to this function
Source Code

Source code is available when you buy a Commercial licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.