Seminars

View all Seminars  |  Download ICal for this event

Birthday Paradox, Monochromatic Subgraphs, and Algorithmic Applications

Series: Department Seminar

Speaker: Prof. Bhaswar B. Bhattacharya Department of Statistics and Data Science, The Wharton School University of Pennsylvania

Date/Time: Nov 17 16:00:00

Location: CSA Seminar Hall (Room No. 254, First Floor)

Abstract:
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.

Speaker Bio:
Prof. Bhaswar Bhattacharya is a faculty in the Department of Statistics and Data Science at the Wharton School, with a secondary appointment in the Department of Mathematics, at the University of Pennsylvania. He received Ph.D from the Department of Statistics at Stanford University in 2016, under supervision of Persi Diaconis. His research interests are in Nonparametric statistics, Combinatorial probability, Discrete and Computational Geometry. Microsoft teams link: https://teams.microsoft.com/l/meetup-join/19%3ameeting_N2Y3MThjNWEtOWRiOC00NjEzLWExMWUtYTgzNDkyZTY0YmY4%40thread.v2/0?context=%7b%22Tid%22%3a%226f15cd97-f6a7-41e3-b2c5-ad4193976476%22%2c%22Oid%22%3a%22c747ccaa-ceaa-4197-b4cb-ce2f1d4694da%22%7d

Host Faculty: Prof. Ambedkar Dukkipati