Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, September 23, 2010, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Will Perkins (NYU)

Forgetfulness of Balls and Bins

Consider two probability distributions on random graphs. In the first we add M random edges. In the second we plant a Hamiltonian cycle, then add (M-n) random edges on top. How large must M be for the two distributions to be statistically indistinguishable? Somewhat surprisingly the distributions are distinguishable for M as high as n^{3/2}, far higher than the threshold for the appearance of Hamiltonian cycles in the random graph. We look at a pure probability model of this phenomenon: if we plant k balls in some arrangement in n labeled bins, how many balls must we throw at random on top to 'forget' the initial planting? We give the exact threshold and total variation limit for any given initial planting. The case of unlabeled bins raises some questions about the concentration of sums of lognormal random variables.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login