BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260518T122105EDT-1825SusPaU@132.216.98.100
DTSTAMP:20260518T162105Z
DESCRIPTION:CRM-ISM Probability Seminar\n\nTitle: Sparse random graphs with
  overlapping community structure\n\nAbstract: In this talk we introduce tw
 o different random graph models that produce sparse graphs with overlappin
 g community structure and discuss community detection in each context. The
  Random Overlapping Community (ROC) model produces a sparse graph by const
 ructing many Erdos Renyi random graphs (communities) on small randomly sel
 ected subsets of vertices. By varying the size and density of these commun
 ities\, ROC graphs can be tuned to exhibit a wide range normalized of clos
 ed walk count vectors\, including those of hypercubes. This is joint work 
 with Santosh Vempala. In the second half of the talk\, we introduce the Co
 mmunity Configuration Model (CCM)\, a variant of the configuration model i
 n which half-edges are assigned colors and pair according to a matching ru
 le on the colors. The model is a generalization of models in the statistic
 al physics literature and is a natural finite analog for classes of graphe
 xes. We describe a hypothesis testing algorithm that determines whether a 
 graph came from a community configuration model or a traditional configura
 tion model. This is joint work with Christian Borgs\, Jennifer Chayes\, So
 uvik Dhara\, and Subhabrata Sen.\n\nhttps://mcgill.zoom.us/j/87596694672?p
 wd=VG5WZjllUFdQVWxjN29rV2RMZDFlUT09\n\n \n
DTSTART:20210217T180000Z
DTEND:20210217T190000Z
SUMMARY:Sam Petti (Harvard)
URL:https://www.mcgill.ca/mathstat/channels/event/sam-petti-harvard-327892
END:VEVENT
END:VCALENDAR