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:6827e1df347d8
DTSTART;TZID=America/Toronto:20231106T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231106T113000
URL:/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-jane-breen
SUMMARY:Algebraic Graph Theory - Jane Breen
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Kemeny’s constant and random walks on grap
 hs\n\nSPEAKER:\n Jane Breen\n\nAFFILIATION:\n Ontario Tech University\n\nL
 OCATION:\n Please contact Sabrina Lato for Zoom link.\n\nABSTRACT: Kemen
 y's constant is an interesting and useful quantifier of\nhow well-connecte
 d 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 Keme
 ny's constant is interpreted as a measure of\nhow `well-connected' the gra
 ph is. Though it was first introduced in\nthe 1960s\, interest in this con
 cept has recently exploded. This talk\nwill provide an introduction to Mar
 kov chains\, an overview of the\nhistory of Kemeny’s constant\, discussi
 on of some applications\, and a\nsurvey of recent results\, with an emphas
 is on those that are\nextensions or generalizations of simple random walks
  on graphs\, to\ncomplement Sooyeong’s talk from two weeks ago.\n 
DTSTAMP:20250517T010951Z
END:VEVENT
END:VCALENDAR