logo

European Institute for Statistics, Probability, Stochastic Operations Research
and their Applications

About | Research | Events | People | Reports | Alumni | ContactHome


 

Reading Seminar Series

on

Markov Chains and Mixing Times

Venue: Green Room at Eurandom
15.45  - 17.30 h.

 

Name                                                     Date                      Title  

Pierre-Yves Louis 12-06-2012 Chapter 22. Coupling from the past
Francesca Nardi + Carlo Lancia 05-06-2012 Chapter 18. The Cutoff Phenomenon (part 2 )
Francesca Nardi + Carlo Lancia 29-05-2012 Chapter 18. The Cutoff Phenomenon (part 1)
Serban Badila 15-05-2012 Martingales and evolving sets - Chapter 17 
Nikhil Bansal 08-05-2012 The transportation metric and path coupling
Alessandro Di Bucchianico 01-05-2012 Simulation via Markov Chain Monte Carlo methods
Alexander Marynych 17-04-2012 Spectral theory of Markov chains with finite state-space(Chapter 12)
Robert Fitzner 10-04-2012 Hitting and cover times  (Chapter 10-11)
Sander Dommers 03-04-2012 (Chapter 9)
Jaron Sanders 27-03-2012   (Chapter 5-7)
Alessandro Zocca 20-03-2012 Introduction to Markov Chain Mixing (Chapter 4 of the book)

 

ABSTRACTS

Serban Badila

Martingales and evolving sets - Chapter 17 

 


Nikhil Bansal

The transportation metric and path coupling

I will talk about some topics from chapters 13 and 14, with particular focus on the transportation metric, path coupling, and approximate counting via Markov chains.


Alessandro Di Bucchianico

Simulation via Markov Chain Monte Carlo methods

I will provide an introduction to the use of Markov chains in simulation known as Markov Chain Monte Carlo (MCMC). This technique is widely used in several research areas, including Statistical Physics and Bayesian statistics.  I will show the Markov chain setting behind the two main forms (the Gibbs sampler and the Metropolis-Hastings sampler) and put these methods in a wider context of simulation techniques. This presentation is partly based on Chapter 3 of the book and partly based introductory articles on MCMC.

Literature:

C. Andrieu, N. De Freitas , A. Doucet, and M.I. Jordan, An Introduction to MCMC for Machine Learning, Machine Learning 50 (2003), 5-43. G. Casella and J. Berger, Explaining the Gibbs Sampler, American Statistician 46 (1992), 167-174.
S. Chib and E. Greenberg, Understanding the Metropolis-Hastings Algorithm, American Statistician 49 (1995), 327-335
P. Diaconis, The Markov Chain Monte Carlo Revolution, Bulletin of the AMS 46 (2009), 179-205
J.S. Liu, Monte Carlo Strategies in Scientific Computing, Springer, 2001.


Alexander Marynych

On this seminar we will explore the connection between mixing properties of Markov chain and spectral structure
of its transition matrix. In particular we will give upper and lower bounds on the mixing time in terms of eigenvalues.
 


Robert Fitzner

In this session of the reading seminar we will discuss a number of stopping times of random walks on general graphs. We review hitting, random target, commute and cover times. We compute them on some simple graphs and in the process highlight the connections between these times.


Alessandro Zocca

In this first meeting we will present some key concepts and tools which will be used during the whole reading seminar, among them the total variation distance and its property, the coupling technique and mixing times. We will then start exploring the deep connections existing between these objects, focusing in particular on the case of Markov chains.


Last updated 24-05-12
Maintained by
PK

 

 

  P.O. Box 513, 5600 MB  Eindhoven, The Netherlands
tel. +31 40 2478100  fax +31 40 2478190  
  e-mail: 
info@eurandom.tue.nl