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, December 18, 2012, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Wolfgang Woess (Graz University of Technology)

On the duality between jump processes on ultrametric spaces and random walks on trees

Ultrametric spaces arise in various contexts, such as the p-adic numbers, the space of ends of an infinite tree, or the space of all rooted (finite or infinite) locally finite, connected graphs. Every reasonable ultrametric space can be described as the space of ends of a tree.

There is a very natural recent construction of Markov processes on ultrametric spaces, due to Bendikov, Grigoryan and Pittet. It simplifies previous concepts and allows a very detailed analysis.

In my talk, I will try to explain the link between those processes and random walks on trees.

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