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:69d0d1422012e
DTSTART;TZID=America/Toronto:20240115T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240115T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-carolyn-reinhart
SUMMARY:Algebraic Graph Theory - Carolyn Reinhart
CLASS:PUBLIC
DESCRIPTION:TITLE: The non-backtracking matrix\n\nSPEAKER:\n Carolyn Reinha
 rt\n\nAFFILIATION:\n Swarthmore College\n\nLOCATION:\n Please contact Sab
 rina Lato for Zoom link.\n\nABSTRACT: A non-backtracking walk in a graph 
 is any traversal of the\nvertices of a graph such that no edge is immediat
 ely repeated. The\nnon-backtracking matrix of a graph is indexed by the di
 rected edges of\nthe graph\, and encodes if two edges can be traversed in 
 succession.\nSince this matrix is not symmetric\, the question of when the
  matrix is\ndiagonalizable is of interest to those who study it. Equivalen
 tly\,\nsuch graphs have a non-trivial Jordan block. In this talk\, I will\
 npresent an overview of the non-backtracking matrix\, including its\nhisto
 ry and applications. Finally\, I will present recent results about\ngraphs
  with non-trivial Jordan blocks for the non-backtracking matrix\nfrom join
 t work with Kristin Heysse\, Kate Lorenzen\, and Xinyu Wu.
DTSTAMP:20260404T085218Z
END:VEVENT
END:VCALENDAR