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:6877995017c98
DTSTART;TZID=America/Toronto:20250113T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250113T123000
URL:/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-alexander-van-werde
SUMMARY:Algebraic Graph Theory-Alexander Van Werde
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Towards generalized spectral determinacy of 
 random graphs\n\nSPEAKER:\n Alexander Van Werde\n\nAFFILIATION:\n Eindhove
 n University of Technology\n\nLOCATION:\n Please contact Sabrina Lato fo
 r Zoom link.\n\nABSTRACT: Wang and Xu (2006\, 2017) discovered sufficient 
 conditions\nfor a graph to be uniquely characterized by the spectra of its
 \nadjacency matrix and of its complement graph. They conjectured that\nthe
 se conditions are satisfied with nonvanishing frequency\, but this\nremain
 s open and it was not clear what proof techniques could be used.\nI will p
 resent a new line of attack which approaches the problem as a\nquestion ab
 out random groups. This allows making connections to proof\ntechniques fro
 m combinatorial random matrix theory. The results which\nI will present ar
 e in a toy case\, but it is expected that the employed\nperspective will g
 eneralize.  \n\nThis talk is based on my paper “_Cokernel statistics fo
 r walk\nmatrices of directed and weighted random graphs”_ [Combinatoric
 s\,\nProbability and Computing (2025)\n[https://doi.org/10.1017/S096354832
 4000312]]\n 
DTSTAMP:20250716T122136Z
END:VEVENT
END:VCALENDAR