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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, January 30, 2007, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Bernd Gärtner

Random Walks on Polytope Digraphs - Episode I

We have the graph of a simple d-polytope with n vertices, and the edges oriented by a linear function. We consider the canonical random walk: from the current vertex, proceed along an outgoing edge chosen uniformly at random among all outgoing edges. I will prove a weak but nontrivial bound of O(n/sqrt(d)) on the expected number of steps taken by the walk before it reaches the sink.

Joint work with Volker Kaibel.

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

Previous talks by year:   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