AMSI Lecturer

Home / AMSI Lecturer
Each year AMSI supports and sponsors eminent international researchers through the scientific program in conjunction with SSAI, and ANZIAM.
This annual event gives the research community and the general public an opportunity to hear top academics in the fields of both pure and applied mathematics speak about their research.

2016 AMSI SSAI Lecturer

2017 AMSI ANZIAM Lecturer

Professor Jeffrey Rosenthal

Professor of Statistics, University of Toronto

Tour dates
28/11/2016 – 16/12/2016

Associate Professor Maria Vlasiou

Eindhoven University of Technology

Tour dates
13/02/2017 – 24/02/2017
Jeffrey Rosenthal is a professor in the Department of Statistics at the University of Toronto. Born in Scarborough, Ontario, Canada in 1967, he received his BSc in Mathematics, Physics, and Computer Science from the University of Toronto at the age of 20, his PhD in Mathematics from Harvard University at the age of 24, and tenure in the Department of Statistics at the University of Toronto at the age of 29.

For his research, Rosenthal was awarded the 2006 CRM-SSC Prize, and also the 2007 COPSS Presidents’ Award, the most prestigious honour bestowed by the Committee of Presidents of Statistical Societies. For his teaching, he received a Harvard University Teaching Award in 1991, and an Arts and Science Outstanding Teaching Award at the University of Toronto in 1998. He was elected to Fellowship of the Institute of Mathematical Statistics in 2005, and of the Royal Society of Canada in 2012, and was awarded the SSC Gold Medal in 2013.

Rosenthal’s book for the general public, Struck by Lightning: The Curious World of Probabilities, was published in sixteen editions and ten languages, and was a bestseller in Canada. It led to numerous media and public appearances, and to his work exposing the Ontario lottery retailer scandal. Rosenthal has also published two textbooks about probability theory, and over ninety refereed research papers, many related to the field of Markov chain Monte Carlo randomised computer algorithms and to interdisciplinary applications of statistics. He has dabbled as a computer game programmer, musical performer, and improvisational comedy performer, and is fluent in French. His web site is www.probability.ca.

Despite being born on Friday the thirteenth, Rosenthal has been a very fortunate person.

Specialist Lecture – The Mathematics of MCMC

Markov chain Monte Carlo (MCMC) algorithms, such as the Metropolis Algorithm and the Gibbs Sampler, are extremely useful and popular for approximately sampling from complicated probability distributions through repeated randomness. They are frequently applied to such diverse subjects as Bayesian statistics, physical chemistry, medical research, financial modeling, numerical integration, and more. This talk will use simple graphical simulations to explain how these algorithms work, and why they are so useful. It will also describe how mathematical analysis can provide deeper insights into their implementation, optimisation, and convergence times, and can even allow us to “adapt” the algorithms to improve their performance on the fly.

Public Lecture – From Lotteries to Polls to Monte Carlo

This talk will discuss randomness and probability, to answer such questions as: Just how unlikely is it to win a lottery jackpot? If you flip 100 coins, how close will the number of heads be to 50? How many dying patients must be saved to demonstrate that a new medical drug is effective? Why do strange coincidences occur so often? If a poll samples 1,000 people, how accurate are the results? How did statistics help to expose the Ontario Lottery Retailer Scandal? If two babies die in the same family without apparent cause, should the parents be convicted of murder? Why do casinos always make money, even though gamblers sometimes win and sometimes lose? And how is all of this related to Monte Carlo Algorithms, an extremely popular and effective method for scientific computing? No mathematical background is required to attend.

SSA Conference Plenary Talk – Adaptive MCMC For Everyone

Markov chain Monte Carlo (MCMC) algorithms, such as the Metropolis Algorithm and the Gibbs Sampler, are an extremely useful and popular method of approximately sampling from complicated probability distributions. Adaptive MCMC attempts to automatically modify the algorithm while it runs, to improve its performance on the fly. However, such adaptation often destroys the ergodicity properties necessary for the algorithm to be valid. In this talk, we first illustrate MCMC algorithms using simple graphical Java applets. We then discuss adaptive MCMC, and present examples and theorems concerning its ergodicity and efficiency. We close with some recent ideas which make adaptive MCMC more widely applicable in broader contexts.

Please check back soon for a full profile of Associate Professor Maria Vlasiou.

Tour abstract to be confirmed.

Questions?

Please contact Liam Williamson via liam@amsi.org.au, if you would like further information about the lecture tour.