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, May 24, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Nicla Bernasconi

Properties of Random Graphs via Boltzmann Samplers

The framework of Boltzmann samplers of Duchon et al. is an efficient method for sampling objects uniformly at random from graph classes with structural constraints, such as planar graphs. We analyze the execution of Boltzmann sampler algorithms of different classes to derive results about the structure of a random object of these classes. In particular, we determine the degree sequence of random outerplanar graphs, and derive tight bounds for the tail probabilities.

Joint work with Konstantinos Panagiotou and Angelika Steger.

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