BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20210303T161500
DTEND;TZID=America/Los_Angeles:20210303T173000
DTSTAMP:20260520T125327
CREATED:20210204T003334Z
LAST-MODIFIED:20210221T214207Z
UID:2166-1614788100-1614792600@colleges.claremont.edu
SUMMARY:Ioana Dumitriu
DESCRIPTION:Title:  Spectral gap in random regular graphs and hypergraphs \nAbstract: Random graphs and hypergraphs have been used for decades to model large-scale networks\, from biological\, to electrical\, and to social. Various random graphs (and their not-so-random properties) have been connected to algorithms solving problems from community detection to matrix completion\, coding theory\, and various other statistics / machine learning fundamental questions; in the past decade\, this research area has expanded to include random hypergraphs. One of these special properties is the spectral gap for graph-associated matrices; roughly speaking\, it means that the main eigenvalue(s) are well-separated from the bulk and it guarantees strong connectivity properties. This talk will take a look at the spectra of adjacency / Laplacian matrices for some random regular models\, explain how we know that the spectral gap is there\, and connect spectral properties to the aforementioned applications. It will cover joint work with Gerandy Brito\, Kameron Decker Harris\, and Yizhe Zhu.  \nIoana Dumitriu is a Professor of Mathematics at The University of California\, San Diego.
URL:https://colleges.claremont.edu/ccms/event/ioana-dumitru/
LOCATION:Zoom
CATEGORIES:Colloquium
ORGANIZER;CN="Helen Wong":MAILTO:hwong@cmc.edu
END:VEVENT
END:VCALENDAR