English

How to produce discreet Gaussian sequences: Algorithm and code

Data Analysis, Statistics and Probability 2011-12-19 v1

Abstract

Algorithm and code to produce sequences whose members obey Gaussian distribution function is reported. Discreet and limited number of groups are defined in the distribution function, where each group is represented only with one value instead of a range of value. The produced sequences are also checked back whether they still fit the discreet distribution function. Increasing of number of particles N increases the value of correlation coefficient R^2, but increasing number of groups M reduces it. Value R^2 = 1 can be found for N = 1000000 at least with M = 5000$ and for M = 10 at least with N = 1000.

Keywords

Cite

@article{arxiv.1107.3291,
  title  = {How to produce discreet Gaussian sequences: Algorithm and code},
  author = {Sparisoma Viridi and Veinardi Suendo},
  journal= {arXiv preprint arXiv:1107.3291},
  year   = {2011}
}

Comments

18 pages, 5 figures

R2 v1 2026-06-21T18:37:57.120Z