A quasirandom talk

by Brian Hayes

Published 2 February 2015

I’ll be giving a talk at Harvard this Friday, February 6: “Orderly Randomness: Quasirandom Numbers and Quasi–Monte Carlo.” If you’re in the neighborhood, please stop by. Lunch at 12:30; quasirandomness at 1:00 pm.

Update 2015-02-08: Slides online. And video.

Responses from readers:

  • A comment from Vasiliy Kuznetsov, 14 March 2015 at 6:50 am

    Thank you for the video.

  • A comment from Anand Ramalingam, 4 June 2021 at 3:55 pm

    Thanks for a nice introduction to Quasi Random Sampling. Can you please upload the source code for the various sampling illustrated in the presentation?

    Also what software do you use to generate the presentation. It looks very beautiful.

Please note: The bit-player website is no longer equipped to accept and publish comments from readers, but the author is still eager to hear from you. Send comments, criticism, compliments, or corrections to brian@bit-player.org.

Tags for this article: computing, mathematics.

Publication history

First publication: 2 February 2015

Converted to Eleventy framework: 22 April 2025

More to read...

The Middle of the Square

The first random-number generator for a digital computer has long been held up as an example of what not to do. How bad was it?

The Ormat Game

Fun and games with permutation matrices. What a hoot!

The Teetering Towers of Abstraction

Abstraction is an abstraction. You can’t touch it or taste it or photograph it. Yet this ghostly concept is an essential tool in both mathematics and computer science.

The Short Arm of Coincidence

Can a factorial number cozy up to a perfect square, so that \(n! + 1 = m^2\)? Three examples are known. Are there more? The answer is a definite maybe.