BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20240331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20231029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260424T143224Z
UID:1705939200@ist.ac.at
DTSTART:20240122T170000
DTEND:20240122T180000
DESCRIPTION:Speaker: Yuwen Wang\nhosted by M. Beiglböck\, N. Berestycki\, 
 L. Erdös\, J. Maas\, F. Toninelli\, E. Schertzer\nAbstract: The expected 
 hitting time from vertex a to vertex b\, H(a\,b)\, is the expected value o
 f the time it takes a random walk starting at a to reach b. In this talk\,
  we shall discuss estimates for H(a\,b) when the distance between a and b 
 is comparable to the diameter of the graph\, and the graph satisfies a Har
 nack condition. We show that\, in such cases\, H(a\,b) can be estimated us
 ing a formula in terms of the volumes of balls around b. We give an outlin
 e of the proof using Green functions and heat kernel estimates. Using this
  result\, we can then estimate H(a\,b) on various graphs\, such as rectang
 ular tori\, some convex traces on the integer lattice\, and fractal graphs
 .Joint work with Laurent Saloff-Coste.
LOCATION:Mondi 2 (I01.01.008)\, Central Building\, ISTA
ORGANIZER:birgit.oosthuizen-noczil@ist.ac.at 
SUMMARY:Yuwen Wang: Expected hitting time estimates on finite graphs
URL:https://talks-calendar.ista.ac.at/events/4745
END:VEVENT
END:VCALENDAR