Upper escape rate of continuous time random walks

Date
2014/12/05 Fri 14:45 - 15:45
Room
3号館552号室
Speaker
Xueping Huang
Affiliation
Tohoku University
Abstract

For a continuous time symmetric random walk on a weighted graph, we are interested in how far it can run in large time. An upper bound can be given in terms of volume growth of balls with respect to a suitably chosen distance function.
For the proof, we will realize the random walk as a trace of a diffusion on a suitable metric graph and then compare the escape rates by estimating the occupation time of the diffusion on vertices of the metric graph.