Randomised Algorithms and Random Graphs
Additional Info
- ECTS credits: 6
- University: Hamburg University of Technology
- Semester: 2
- Lecturer 1: V. Turau
- Lecturer 2: A. Taraz
-
Objectives:
The course is intended to develop an understanding of the fundamental concepts in randomised algorithms and the theory of random graphs. The primary focus is on the ability to determine average or typical behaviour of algorithms and structures, and to analyze how this behaviour evolves when the underlying random distribution is changing.
-
Topics:
Randomised search, random walks, text search with fingerprinting. parallel and distributed algorithms, online algorithms. Typical properties of random graphs, first and second moment method, tail bounds, thresholds and phase transitions, probabilistic method, models for complex networks.
Published in
Course units
