Adaptive Binning


This program will take a discrete set of data and generate a continuous abundance curve using adaptive binning and interpolation. The output data therefore consists of 2 columns, a continuous rank variable X and a corresponding abundance variable Y. Note that X is not an integer, but is a continuous generalization of the integer rank.

Your data file must be a text file with a single column of numbers. The first number will be the abundance corresponding to the first rank, the second number will be the abundance corresponding to the second rank, etc.

You may directly use the output of the rank abundance program as the input.

Additional feature: This program will also accept 2 columns of data. In that case, the first column is interpreted as a continuous rank, and the second column as the corresponding abundance.

Input Form

Your data file:

Number of histogram bins (at least 5):

This binning algorithm is based on the algorithm given in C. Adami and J. Chu. Critical and near-critical branching processes. Physical Review E 66, 011907 (2002).

Funding Agency Disclaimer      License and Terms of Use

Logo of the University of Illinois at Urbana-Champaign