BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20221117T120000Z
UID:ecd022e50c9e5595c3f58cdf147a5c3c-359
DTSTAMP:19700101T120016Z
DESCRIPTION:Birthday Paradox, Monochromatic Subgraphs, and Algorithmic  Applications
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/359/birthday-paradox-monochromatic-subgraphs-and-algorithmic-applications/
SUMMARY:What is the chance that among a group of friends, there are friends all of whom have the same birthday? This is the celebrated  birthday problem which can be formulated as the existence of a  monochromatic -clique (matching birthdays) in the complete graph , where every vertex of is uniformly colored with 365 colors (corresponding to birthdays). More generally, for a connected graph,  let   be the number of monochromatic copies of in a uniformly random coloring of the vertices of the graph with colors. In this talk, the asymptotic properties of this quantity will be derived, and applications in distributional property testing and computation of discrete logarithms will be discussed.
DTSTART:20221117T120000Z
END:VEVENT
END:VCALENDAR