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:20190821T200345Z
UID:5c8657f92c289931935808@ist.ac.at
DTSTART:20190711T153000
DTEND:20190711T180000
DESCRIPTION:Speaker: Johannes Alt\nhosted by Laszlo Erdös\nAbstract: In th
is talk\, we present recent results on the extreme eigenvalues of the adja
cency matrix of Erd?s-Rnyi graphs. The Erd?s-Rnyi graph G has N vertices a
nd any two vertices are connected with probability p\, independently of ot
her edges. If p is large then the adjacency matrix A of G behaves like a W
igner random matrix and has the semicircle law on [-2\,2] as limiting eige
nvalue density. Moreover\, the extreme eigenvalues converge to -2 and 2\,
respectively. If p is small then\, however\, A has many eigenvalues outsid
e [-2\,2]. Recently\, the critical value of p for this transition has been
determined and a precise connection between the large degrees of G and th
e extreme eigenvalues of A has been established. This is joint work with R
aphael Ducatez and Antti Knowles.
LOCATION:Heinzel Seminar Room / Office Bldg West (I21.EG.101)\, IST Austria
ORGANIZER:boosthui@ist.ac.at
SUMMARY:Extreme Eigenvalues of critical Erdoes-Rényi graphs
URL:https://talks-calendar.app.ist.ac.at/events/2022
END:VEVENT
END:VCALENDAR