Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, January 30, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Bernd Gärtner
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.
Automatic MiSe System Software Version 1.4803M | admin login