BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3ed6ad2df6
DTSTART;TZID=America/Toronto:20231106T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231106T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-jane-breen
SUMMARY:Algebraic Graph Theory - Jane Breen
CLASS:PUBLIC
DESCRIPTION:TITLE: Kemeny’s constant and random walks on graphs\n\nSPEAKE
 R:\n Jane Breen\n\nAFFILIATION:\n Ontario Tech University\n\nLOCATION:\n P
 lease contact Sabrina Lato for Zoom link.\n\nABSTRACT: Kemeny's constant
  is an interesting and useful quantifier of\nhow well-connected the states
  of a Markov chain are. This comes to the\nforefront when the Markov chain
  in question is a random walk on a\ngraph\, in which case Kemeny's constan
 t is interpreted as a measure of\nhow `well-connected' the graph is. Thoug
 h it was first introduced in\nthe 1960s\, interest in this concept has rec
 ently exploded. This talk\nwill provide an introduction to Markov chains\,
  an overview of the\nhistory of Kemeny’s constant\, discussion of some a
 pplications\, and a\nsurvey of recent results\, with an emphasis on those 
 that are\nextensions or generalizations of simple random walks on graphs\,
  to\ncomplement Sooyeong’s talk from two weeks ago.
DTSTAMP:20260418T204530Z
END:VEVENT
END:VCALENDAR