Persi Diaconis
The Mary Sunseri Professor of Statistics
and Professor of Mathematics
Stanford University
“The Search for Randomness”
Abstract: I will examine some of our most
primitive images of random phenomena, e.g. tossing coins, rolling dice,
and shuffling cards. Thinking hard about randomness illuminates issues
in the foundations of mathematics and computation. We will further
appreciate the practical use of large statistical models and computer-generated
random numbers. In each case, while standard procedures can produce randomness,
usually we are lazy, and there are strong biases to be found.
**A lecture on some popular and/or broad aspects of mathematics attractive
to undergraduates and the public
For More Information go to: http://www.humboldt.edu/~mathdept/HarrySKieval/kl.html
HSU is an AA/EO institution.
Disability accommodations may be available from event sponsor at 826-5347
Professor Persi Diaconis
Stanford University
Monday, September 22, 2003, 4:00 P.M.
Natural Resources 101
Pre-Colloquium Tea
Library 56 3:30 P.M.
“What Do We Know About the Metropolis Algorithm”
Abstract: The Metropolis Algorithm is one of the great tools of scientific
computing. I will explain the algorithm and applications in cryptography,
bioinfomatics, and physics. While there is some available theory,
most of the basic questions are open.
“The way I do magic is very similar to mathematics. Inventing a magic trick and inventing a theorem are very, very similar activities in the following sense. In both subjects you have a problem you’re trying to solve with constraints. One difference between magic and mathematics is the competition. The competition in mathematics is a lot stiffer than in magic.”