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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 16, 2006, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Tobias Müller (Univ. of Oxford)

Two-point concentration in random geometric graphs

A random geometric graph Gn is constructed by taking vertices X1, ..., Xn ∈ Rd at random (i.i.d. according to some probability distribution ν) and including an edge between Xi and Xj if |Xi-Xj| < r where r=r(n) > 0. We prove a conjecture of Penrose stating that when n rd = o(ln n) then the probability distribution of the clique number ω(Gn) becomes concentrated on two consecutive integers in the sense that P(ω(Gn) ∈ {k(n), k(n)+1} ) tends to 1 for some sequence k(n).

We also show that the same holds for a number of other graph parameters including the chromatic number Χ(Gn). A series of celebrated results establish that a similar phenomenon occurs in the Erdős-Rényi or G(n,p)-model of random graphs.

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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