Home | deutsch | Impressum | Sitemap | Intranet | KIT
Institute of Stochastics

Secretariat
Kollegiengebäude Mathematik (20.30)
Room 2.056 und 2.002

Address
Karlsruher Institut für Technologie
Institut für Stochastik

Englerstr. 2
D-76131 Karlsruhe

Postadresse:
D-76128 Karlsruhe

Office hours:
Mo-Fr 10:00 - 12:00

Tel.: +49 721 608 43270/43265

Fax.: +49 721 608 46066

Probability Theory and Combinatorial Optimization (Summer Semester 2015)

Lecturer: Prof. Dr. Daniel Hug
Classes: Lecture (0160000), Problem class (0160010)
Weekly hours: 4+2


Schedule
Lecture: Monday 11:30-13:00 SR 2.58
Thursday 9:45-11:15 SR 2.59
Problem class: Wednesday 15:45-17:15 SR 2.59
Lecturers
Lecturer Prof. Dr. Daniel Hug
Office hours: Nach Vereinbarung.
Room 2.051 Kollegiengebäude Mathematik (20.30)
Email: daniel.hug@kit.edu
Problem classes Dr. Fabian Gieringer
Office hours: On appointment.
Room 2.017 Kollegiengebäude Mathematik (20.30)
Email: fabian.gieringer@kit.edu

Course description

This course is devoted to the analysis of algorithms and combinatorial optimization problems in a probabilistic framework. A natural setting for the investigation of such problems is often provided by a (geometric) graph. For a given system (graph), the average or most likely behavior of an objective function of the system will be studied. In addition to asymptotic results, which describe a system as its size increases, quantitative laws for systems of fixed size will be described. Among the specific problems to be explored are

  • the long-common-subsequence problem,
  • packing problems,
  • the Euclidean traveling salesman problem,
  • minimal Euclidean matching,
  • minimal Euclidean spanning tree.

For the analysis of problems of this type, several techniques and concepts have been developed and will be introduced and applied in this course. Some of these are

  • concentration inequalities and concentration of measure,
  • subadditivity and superadditivity,
  • martingale methods,
  • isoperimetry,
  • entropy.

Literature

  • Boucheron, S., Lugosi, G., Massart, P. Concentration Inequalities, Oxford University Press, Oxford, 2013.
  • Dubhashi, D., Panconesi, A. Concentration of Measure for the Analysis of Randomized Algorithms, Cambridge University Press, Cambridge, 2009.
  • Ledoux, M. The Concentration of Measure Phenomenon. American Mathematical Society, vol. 89, 2001.
  • Steele, J.M. Probability Theory and Combinatorial Optimization. SIAM, 1997.
  • Yukich, J.E. Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, Vol. 1675, Springer, Berlin, 1998.
  • Yukich, J.E. Limit Theorems in Discrete Stochastic Geometry. In: Stochastic geometry, spatial statistics and random fields, 239–275, Lecture Notes in Mathematics, Vol. 2068, Springer, Heidelberg, 2013.

Examination

Oral examination (30 minutes) by appointment