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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7c7ed3cf1
DTSTART;TZID=America/Toronto:20250113T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250113T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-alexander-van-werde
SUMMARY:Algebraic Graph Theory-Alexander Van Werde
CLASS:PUBLIC
DESCRIPTION:TITLE: Towards generalized spectral determinacy of random graph
 s\n\nSPEAKER:\n Alexander Van Werde\n\nAFFILIATION:\n Eindhoven University
  of Technology\n\nLOCATION:\n Please contact Sabrina Lato for Zoom link.
 \n\nABSTRACT: Wang and Xu (2006\, 2017) discovered sufficient conditions\n
 for a graph to be uniquely characterized by the spectra of its\nadjacency 
 matrix and of its complement graph. They conjectured that\nthese condition
 s are satisfied with nonvanishing frequency\, but this\nremains open and i
 t was not clear what proof techniques could be used.\nI will present a new
  line of attack which approaches the problem as a\nquestion about random g
 roups. This allows making connections to proof\ntechniques from combinator
 ial random matrix theory. The results which\nI will present are in a toy c
 ase\, but it is expected that the employed\nperspective will generalize. 
  \n\nThis talk is based on my paper “_Cokernel statistics for walk\nmat
 rices of directed and weighted random graphs”_ [Combinatorics\,\nProbab
 ility and Computing (2025)\n[https://doi.org/10.1017/S0963548324000312]]
DTSTAMP:20260403T083822Z
END:VEVENT
END:VCALENDAR