A bound for the discrepancy of digital nets and its application to the analysis of certain pseudo-random number generators

DOI10.4064/AA-83-1-1-15MaRDI QIDQ4354129zbMATHOpenAlexFDO

Authors Gerhard Larcher

Publication date 13 September 1997

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/207103

zbMATH Keywords

low-discrepancy sequencespseudo-random number generatorsdiscrepancy estimate for digital nets

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• scientific article; zbMATH DE number 4090661
• Point sets and sequences with small discrepancy
• A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
• scientific article; zbMATH DE number 2051224
• Improved Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers

Cited in

(3)

• Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the period
• scientific article; zbMATH DE number 5797591 (Why is no real title available?)
• On discrete stochastic processes generated by deterministic sequences and multiplication machines

This page was built for publication: A bound for the discrepancy of digital nets and its application to the analysis of certain pseudo-random number generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354129)