BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260724T062111EDT-74994ZmjI0@132.216.98.100
DTSTAMP:20260724T102111Z
DESCRIPTION:Title: Large deviation for uniform random graphs with given deg
 ree\n	\n	Abstract: Large deviation on random graphs aims to provide a rigoro
 us framework for understanding the atypical or rare events on large networ
 ks. Even for elementary network functionals such as triangle counts\, prov
 ing Large Deviation Principle (LDP) was a long-standing open question. In 
 a breakthrough paper\, Chatterjee and Varadhan (2011) introduced a novel f
 ramework that embedded Erdős-Rényi random graphs into the space of graphon
 s\, and used the theory developed by Lovász and coauthors to prove an LDP 
 on this abstract graphon space. Such a representation yields LDP for all c
 ontinuous functions in the graphon space\, namely subgraph counts\, larges
 t eigenvalue.\n	\n	In this talk\, we explore LDPs for random graphs having c
 onstraints on degrees. Even understanding the typical behavior for random 
 graphs under degree constraints is challenging\, due to absence of the edg
 e-independence. Using the framework of Chatterjee and Varadhan\, we prove 
 an LDP for such graphs on the graphon space. This also gives accurate esti
 mates of the asymptotic number of graphs with given degrees and given subg
 raph densities.\n	\n	This is based on joint work with Subhabrata Sen (Harvar
 d).\n
DTSTART:20200123T170000Z
DTEND:20200123T180000Z
LOCATION:BURN 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Souvik Dhara (MIT)
URL:https://www.mcgill.ca/mathstat/channels/event/souvik-dhara-mit-312312
END:VEVENT
END:VCALENDAR