BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Nodal Statistics for Graphs and Matrices
DTSTART:20260313T121500
DTEND:20260313T131500
DTSTAMP:20260408T154136Z
UID:77782cd25583720db0964b75f2759db179acfccf3ee86c8228f1b77c
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. John Urschel\, MIT\nComputational Mathematics Seminar\n\
 nAbstract : \nGiven a symmetric matrix with a given sign pattern\, what c
 an the sign patterns of its eigenvectors look like? This simple question i
 s closely related to the study of discrete nodal statistics and draws stro
 ng parallels with classical results in analysis for Laplacian eigenfunctio
 ns. In this talk\, we will give an overview of the field\, covering key re
 sults on nodal sets for graphs and their connection to known results and o
 pen problems in the continuous setting. In addition\, we will discuss some
  recent progress towards a more complete understanding of the extremal pro
 perties of the nodal statistics of a matrix
LOCATION:CM 1 517 https://plan.epfl.ch/?room==CM%201%20517
STATUS:CANCELLED
END:VEVENT
END:VCALENDAR