Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, February 20, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Anders Martinsson

Segregating Markov chains

It is a well-known fact that a Markov chain, under some assumptions, ``mixes'' in the sense that it ``forgets its inital state'' and converges to a unique stationary distribution as time tends to infinity. In investigating the rate of this convergence, coupling arguments play a big role. One common idea is to let two copies of the Markov chain, with different starting positions, evolve dependently on each other in some clever way such that they meet up fast, and then bound their distance in distribution by this first meeting time. In this talk, we will investigate an observation by Häggström in which, by removing some standard and commonly overlooked assumptions, it is possible to couple two copies of a Markov chain to meet a.s. while not (completely) mixing. This is joint work with Timo Hirscher.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login