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...

A Shy Woodland Creature

In remembrance of Martin Garner, 1914–2010.

Probabilities of Probabilities

Probabilities are a tool for coping with uncertainty. But what if the probabilities themselves are uncertain?

Ramsey Theory in the Dining Room

We could not form a set of eight matching glasses. But we could assemble eight glasses with no two alike. As I placed them on the table, I thought “Aha, Ramsey theory!”

Foldable Words

In the spring of 1967 I had a girlfriend. After school we would meet at the Maple Diner. One afternoon I noticed she was fiddling intently with the wrapper from her straw, folding and refolding.