BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20200125T182934Z
UID:5b4d8fb087010985934487@ist.ac.at
DTSTART:20190516T160000
DTEND:20190516T170000
DESCRIPTION:Speaker: Agnes Backhausz\nhosted by Laszlo ErdÃ¶s\nAbstract: Th
e goal of the talk is to give an overview on the basic notions of graph li
mit theory\, and to present recent results about its applications to the s
pectral theory of random graphs and random matrices. By identifying contin
uous limit objects (e.g. L^2 operators) as the limit of convergent graph s
equences\, graph limit theory is a powerful combination of tools from anal
ysis\, combinatorics and probability theory. In the first part of the talk
\, we summarize the notions of local limit of bounded degree graphs\, the
limit of dense graph sequences\, and the recently defined notion of action
convergence\, which works for graphs of intermediate density as well. The
n we present two applications on the empirical distribution of eigenvector
s of random regular graphs and random sign matrices. Joint work with Balzs
Szegedy.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
T Austria
ORGANIZER:cpetz@ist.ac.at
SUMMARY:Graph limits and spectral theory
URL:https://talks-calendar.app.ist.ac.at/events/1917
END:VEVENT
END:VCALENDAR