This course is over.
Instead of the lecture, David Schoch is giving a talk on "Network Centrality Based on Representational Theory of Measurements" on Wednesday, July 23, at 17:00 in P 1138.
Lectures and Tutorials (6 SWS/9 ECTS)
Networks have become omnipresent. Besides physical networks as, e.g., in electrical engineering or transportation systems, abstract networks such as the structure of the WWW or constellations of political actors are increasingly analysed. Due to the variety of applications and resulting research questions, a wide range of methods is applied leading to interesting coherences between graph theory, linear algebra and probabilistic methods. In this course, some of the used methods and their theoretical foundations are presented. While research questions will be motivated by examples of application, the focus, however, will be on algorithmic approaches to these problems as well as their assumptions and characteristics. Moreover, we will come across a number of open questions that invite to further work on this topic.
Normally, the assignments are made available on this webpage as a PDF-file (in English) every Thursday at 11:00.
The editing time for each homework is one week. It is due on the next Thursday at 11:00. The assignments have to be delivered in written form in English and have to be submitted electronically to the corresponding teaching assistants (as one PDF only). Please follow the naming schema uXX_name1_name2.pdf, where XX indicates the number of the assignment. We will return the corrected and scored assignments in the tutorial. Whatever is not picked up can be retrieved from the corresponding teaching assistant (Habiba PZ1012, David PZ1011).
The requirements for the admittance to the final exam are 50 percent of the total score of the assignments, regular attendance at the tutorials, and the presentation of at least two of your solutions of the assignments. In writing up your assignments, be as clear, precise, and concise as possible. Understandability will be an important factor in the scoring of the assignments. There will be approximately twelve written assignments. Regular attendance is considered especially for borderline cases.
You are permitted and encouraged to work in groups of two.
Course Notes and Supplemental Material
Lecture notes of the previous edition of this course (in German). Note that the content is revised again this year:
Lecture notes for this edition (locally accessible only). We attempt to provide updates in a timely manner:
The friendship paradox:
- Ulrik Brandes, Thomas Erlebach (eds.): Network Analysis - Methodological Foundations. Lecture Notes in Computer Science #3418, Springer-Verlag, Berlin, 2005.
- Reinhard Diestel: Graph Theory. 4th edition, Springer-Verlag, Berlin, 2010.
- Eric D. Kolaczyk: Statistical Analysis of Network Data. Springer-Verlag, Berlin, 2009.
- Angelika Steger: Diskrete Strukturen 1 - Kombinatorik, Graphentheorie, Algebra. Springer-Verlag, Berlin, 2001.
- Stanley Wasserman, Katherine Faust: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge, 1995.