University of Konstanz
Algorithmics Group
Prof. Dr. Ulrik Brandes

Network Analysis (SS 2014)

Announcements

Instead of the lecture, David Schoch is giving a talk on "Network Centrality Based on Representational Theory of Measuremenz" on Wednesday, July 23, at 17:00 in P 1138.

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.

General Information

Lecture (U. Brandes, S. Kosub) Tue 17:00 - 18:30 (D 436)
Wed 17:00 - 18:30 (D 436)
Tutorial (Habiba, D. Schoch) Mon 17:00 - 18:30 (E 403)
Oral Exam 1st date: July 31
2nd date: October 16

Please register for this course in the StudIS and LSF.

Homework Assignments

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.

No. Posted Due Date Tutorial Download Tutor Additional Material
00 28.04.2014 Intro to Graph Theory David
01 24.04.2014 01.05.2014 05.05.2014 Assignment1.pdf David
02 01.05.2014 08.05.2014 12.05.2014 Assignment2.pdf Habiba
03 08.05.2014 15.05.2014 19.05.2014 Assignment3.pdf David
04 15.05.2014 22.05.2014 26.05.2014 Assignment4.pdf David
05 22.05.2014 29.05.2014 02.06.2014 Assignment5.pdf David
06 29.05.2014 05.06.2014 16.06.2014 Assignment6.pdf David
07 05.06.2014 12.06.2014 16.06.2014 Assignment7.pdf David
08 12.06.2014 19.06.2014 23.06.2014 Assignment8.pdf Habiba
09 19.06.2014 26.06.2014 30.06.2014 Assignment9.pdf Habiba
10 26.06.2014 03.07.2014 07.07.2014 Assignment10.pdf Habiba
11 03.07.2014 10.07.2014 14.07.2014 Assignment11.pdf Habiba
12 10.07.2014 17.07.2014 21.07.2014 Assignment12.pdf Habiba

Course Notes and Supplemental Material

Non-public material is accessible only from local machines (IP 134.34.*.*) or via VPN.

  • 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. We attempt to provide updates in a timely manner.
  • Friendship Paradox
  • Attempted definitions: social network, network analysis
  • Textbooks

    Further Information (in German)