Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, February 21, 2013, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Johannes Lengler
Start with some integer X0. Then iteratively choose the integer Xn+1 uniformly at random between 1 and 1.99*Xn. How long do you need until you reach 1?
For this question we must relate two different concepts. On the one hand, we do know something about the expectation of Xn, or more precisely, about the expected drift Xn-Xn+1. On the other hand, we would like to know something about the hitting time, i.e. the time until we reach 1. Although these are very different concept , they are related by drift analysis. I will show you the basic theorems and how to apply them to random walks.
P.S.: (At least) one result will surprise you.
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