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: Thursday, September 17, 2009, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Luca Gugelmann

Random walks and electrical networks

The aim of this talk is to present the connections that exist between random walks on a graph G and the electrical network obtained by replacing each edge of G with a resistor. We will then use these connections together with well known facts about electrical networks (Ohm's law, Kirchhoff's laws, Rayleigh...) to prove Polya's famous theorem that the random walk in Z^d is recurrent for d=1,2 and transient otherwise.

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