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, October 10, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Malte Milatz

Random walks on polytopes

Given a polytope with directed edges, a directed random walk on the polytope moves from vertex to vertex, always moving along one of the outgoing edges chosen uniformly at random. (You can just think of the Random-Edge algorithm for linear programming.)

Let $d$ denote the dimension and $n$ the number of facets. The number $r = n-d$ is called the corank of the polytope. We show that a directed random walk may take $\Omega(\log^r n)$ steps when $r$ is fixed and the edges are directed according to a linear function.

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