Intensive statistical complexity measure of pseudorandom number generators

✍ Scribed by H.A. Larrondo; C.M. González; M.T. Martín; A. Plastino; O.A. Rosso

• Publisher: Elsevier Science
• Year: 2005
• Tongue: English
• Weight: 245 KB
• Volume: 356
• Category: Article
• ISSN: 0378-4371
• DOI: 10.1016/j.physa.2005.05.025

✦ Synopsis

A Statistical Complexity measure has been recently proposed to quantify the performance of chaotic Pseudorandom number generators (PRNG) (Physica A 354 (2005) 281). Here we revisit this quantifier and introduce two important improvements: (i) consideration of an intensive statistical complexity (Physica A 334 (2004) 119), and (ii) following the prescription of Brand and Pompe (Phys. Rev. Lett. 88 (2002) 174102-1) in evaluating the probability distribution associated with the PRNG. The ensuing new measure is applied to a very welltested PRNG advanced by Marsaglia.