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 04, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Luca Gugelmann

Random Graph Processes and the Differential Equation Method

The goal of this talk is to present a differential equations technique which is particularly useful when working with graph processes. In such a process we are usually interested in the evolution of random variables, such as the size of the largest component or the proportion of isolated vertices, over "time" (i.e. added edges). The idea is to describe the expected change of these variables in each step of the process by a set of differential equations. The hope is then that the solutions to the differential equations closely approximate the original random variables. We show how this technique can be successfully applied in various settings and present a result by Wormald which provides bounds on the quality of the approximation and sufficient conditions for this technique to work.

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