Golden ratio versus pi as random sequence sources for Monte Carlo integration

The algebraic irrational number golden ratio @f=(1+5)/2 = one of the two roots of the algebraic equation x^2-x-1=0 and the transcendental number @p=2sin^-^1(1) = the ratio of the circumference and the diameter of any circle both have infinite number of digits with no apparent pattern. We discuss here the relative merits of these numbers as possible random sequence sources. The quality of these sequences is not judged directly based on the outcome of all known tests for the randomness of a sequence. Instead, it is determined implicitly by the accuracy of the Monte Carlo integration in a statistical sense. Since our main motive of using a random sequence is to solve real-world problems, it is more desirable if we compare the quality of the sequences based on their performances for these problems in terms of quality/accuracy of the output. We also compare these sources against those generated by a popular pseudo-random generator, viz., the Matlab rand and the quasi-random generator halton both in terms of error and time complexity. Our study demonstrates that consecutive blocks of digits of each of these numbers produce a good random sequence source. It is observed that randomly chosen blocks of digits do not have any remarkable advantage over consecutive blocks for the accuracy of the Monte Carlo integration. Also, it reveals that @p is a better source of a random sequence than @f when the accuracy of the integration is concerned.

[1]  Mark M. Meysenburg,et al.  Randomness and GA performance, revisited , 1999 .

[2]  Syamal K. Sen,et al.  QUASI-VERSUS PSEUDO-RANDOM GENERATORS: DISCREPANCY, COMPLEXITY AND INTEGRATION-ERROR BASED COMPARISON , 2006 .

[3]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[4]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[5]  James A. Foster,et al.  The Quality of Pseudo-Random Number Generations and Simple Genetic Algorithm Performance , 1997, ICGA.

[6]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[7]  Prabhakar Raghavan,et al.  Randomized algorithms and pseudorandom numbers , 1988, STOC '88.

[8]  Erick Cantú-Paz,et al.  On Random Numbers and the Performance of Genetic Algorithms , 2002, GECCO.

[9]  Silvio Galanti,et al.  Low-Discrepancy Sequences , 1997 .

[10]  H. Faure.  Discrépance de suites associées à un système de numération (en dimension s) , 1982 .

[11]  Gregory Gutin,et al.  The traveling salesman problem , 2006, Discret. Optim..

[12]  E. V. Krishnamurthy,et al.  Numerical algorithms : computations in science and engineering , 2008 .

[13]  Shuhei Kimura,et al.  Genetic algorithms using low-discrepancy sequences , 2005, GECCO '05.

[14]  H. Niederreiter.  Low-discrepancy and low-dispersion sequences , 1988 .

[15]  A. Volgenant,et al.  The travelling salesman, computational solutions for TSP applications , 1996 .

[16]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[17]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[18]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[19]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[20]  V. Lakshmikantham,et al.  Computational Error and Complexity in Science and Engineering , 2005 .

[21]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

[22]  Pierre L'Ecuyer,et al.  Software for uniform random number generation: distinguishing the good and the bad , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[23]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[24]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[25]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[26]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[27]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[28]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[29]  Petr Beckmann,et al.  A History of Pi , 1970 .

[30]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[31]  Bruce L. Golden,et al.  Solvingk-shortest and constrained shortest path problems efficiently , 1989 .

[32]  Mark Fleischer.  Simulated annealing: past, present, and future , 1995, WSC '95.

[33]  Ravi P. Agarwal,et al.  Golden ratio in science, as random sequence source, its computation and beyond , 2008, Comput. Math. Appl..

[34]  Syamal K. Sen,et al.  Random number generators: mc integration and tsp-solving by simulated annealing, genetic, and ant system approaches , 2006 .

[35]  P. Bahr,et al.  Sampling: Theory and Applications , 2020, Applied and Numerical Harmonic Analysis.