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: Wednesday, September 25, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Matan Harel (Courant Institute of Mathematical Sciences)

Localization in Random Geometric Graphs with Too Many Edges

Consider a random geometric graph G(n, r(n)), given by a connecting two vertices of a Poisson Point Process of intensity n on the unit torus whenever their distance is smaller than the parameter r(n). This model is conditioned on the rare event that the number of edges observed, |E|, is greater than [1 + delta (n)] times its expectation, producing a three parameter model. We show that, for delta constant or vanishing sufficiently slowly in n, with high probability, there exists a "giant clique" with almost all of the excess edges. Furthermore, if delta vanishes sufficiently quickly, the largest clique will be, at most, a constant multiple of the usual clique number of the unconditioned random geometric graph; roughly, all excess edges will result from the "standard" entropy-like effects of a vanishing Radon-Nykodyn derivative. Finally, we discuss progress in finding a phase transition function delta0(n), so that when delta is much bigger than delta0, the giant clique scenario holds, while delta much smaller than delta0 implies the entropy scenario.


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