Skip to main content
  • Book
  • © 1998

Random and Quasi-Random Point Sets

Part of the book series: Lecture Notes in Statistics (LNS, volume 138)

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xii
  2. Lattice Rules: How Well Do They Measure Up?

    • Fred J. Hickernell
    Pages 109-166
  3. Digital Point Sets: Analysis and Application

    • Gerhard Larcher
    Pages 167-222
  4. Random Number Generators: Selection Criteria and Testing

    • Pierre L’Ecuyer, Peter Hellekalek
    Pages 223-265
  5. Nets, (t, s)-Sequences, and Algebraic Geometry

    • Harald Niederreiter, Chaoping Xing
    Pages 267-302
  6. Back Matter

    Pages 333-334

About this book

This volume is a collection of survey papers on recent developments in the fields of quasi-Monte Carlo methods and uniform random number generation. We will cover a broad spectrum of questions, from advanced metric number theory to pricing financial derivatives. The Monte Carlo method is one of the most important tools of system modeling. Deterministic algorithms, so-called uniform random number gen­ erators, are used to produce the input for the model systems on computers. Such generators are assessed by theoretical ("a priori") and by empirical tests. In the a priori analysis, we study figures of merit that measure the uniformity of certain high-dimensional "random" point sets. The degree of uniformity is strongly related to the degree of correlations within the random numbers. The quasi-Monte Carlo approach aims at improving the rate of conver­ gence in the Monte Carlo method by number-theoretic techniques. It yields deterministic bounds for the approximation error. The main mathematical tool here are so-called low-discrepancy sequences. These "quasi-random" points are produced by deterministic algorithms and should be as "super"­ uniformly distributed as possible. Hence, both in uniform random number generation and in quasi-Monte Carlo methods, we study the uniformity of deterministically generated point sets in high dimensions. By a (common) abuse oflanguage, one speaks of random and quasi-random point sets. The central questions treated in this book are (i) how to generate, (ii) how to analyze, and (iii) how to apply such high-dimensional point sets.

Editors and Affiliations

  • Institut für Mathematik, Universität Salzburg, Salzburg, Austria

    Peter Hellekalek, Gerhard Larcher

Bibliographic Information

  • Book Title: Random and Quasi-Random Point Sets

  • Editors: Peter Hellekalek, Gerhard Larcher

  • Series Title: Lecture Notes in Statistics

  • DOI: https://doi.org/10.1007/978-1-4612-1702-2

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1998

  • Softcover ISBN: 978-0-387-98554-1Published: 09 October 1998

  • eBook ISBN: 978-1-4612-1702-2Published: 06 December 2012

  • Series ISSN: 0930-0325

  • Series E-ISSN: 2197-7186

  • Edition Number: 1

  • Number of Pages: XII, 334

  • Number of Illustrations: 9 b/w illustrations

  • Topics: Statistics, general, Probability Theory and Stochastic Processes

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access