This course will cover a variety of interesting topics on network theory and dynamic systems (e.g., markets, auctions etc.). The student should become enabled to understand the structure and the dynamics of network models and how to apply them to structures of artefacts and human behaviors in the World Wide Web.
Students are expected to have background knowledge on linear algebra:
- know what a matrix is;
- know how matrix multiplication works;
- know what eigenvalues and eigenvectors are.
We recommend some online videos  explaining these ideas if you are not familiar with them yet.
- First exam: 02.08.2019 Fr. 14:00 ~ 16:00 s.t. D028
The lectures will be held by Prof. Steffen Staab and Dr. Sarah de Nigris.
KLIPS entry: https://klips.uni-koblenz-landau.de/v/112826
Video recordings on Panopto
Students will deepen their understanding of this course during the exercises. Assignments can be accomplished in groups of at most two persons. Students need to accomplish at least 60% of the assignments in order to attend the final exam. Plagiarism is strictly forbidden and will result in disqualification from the final exam, of both sides of the plagiarism (copying and being copied). Students are also expected to explain some of the assignments.
KLIPS entry: https://klips.uni-koblenz-landau.de/v/112827
Form and register your teams:https://ist.uni-koblenz.de/teams/en/user/registration/915c8a2d-7492-46bd-8af9-d1d2bc7b77ea to form and view your team by Apr 22.
SVN repositories: https://svn.uni-koblenz.de/westteaching/ntds-19/<group_name> (available from Apr 23 on).
(A tutorial on SVN: https://www.tutorialspoint.com/svn/index.htm)
Time and Location
|Monday||14:00 ～ 16:00||weekly||08.04.2019 to 15.07.2019||E 114|
|Friday||10:00 ～ 12:00||weekly||12.04.2019 to 19.07.2019||E 313|
Networks, Crowds, and Markets: Reasoning about a Highly Connected World
Network Science by ALBERT-LÁSZLÓ BARABÁSI
Networks – An Introduction
M. Newman Oxford University Press, 2010
NOTE: We have strict rules and zero tolerance on Plagiarism. Plagiarism is strictly forbidden and will result in disqualification from the final exam, of both sides of the plagiarism (copying and being copied). Unfortunately this happened in previous terms and we definitely do not want it to happen again.
|Announced on||Due by||Tutorial on||Solution|
|Assignment 1, pdf||April 10||April 24||April 26||sol-1|
|Assignment 2, pdf||April 24||May 8||May 10||sol-2|
|Assignment 3, pdf||May 8||May 22||May 24||sol-3|
|Assignment 4, pdf||May 22||June 5||June 7|
|April 8 - Mo||Lecture||Steffen||ntds-1-intro.pptx
|April 12 - Fr||Tutorial||Jun||ntds-tut-1|
|April 15 - Mo||Lecture||Steffen||ntds-2-strongweakties.pptx
|April 19 - Fr||No lecture / tutorial - public holiday|
|April 22 - Mo||No lecture / tutorial - public holiday|
|April 26 - Fr||Tutorial||Jun||ntds-tut-2|
|April 29 - Mo||Lecture||Steffen||ntds-3-degreedistributions.pptx
|May 3 - Fr||Lecture||Steffen||ntds-4-smallworld.pptx
|May 6 - Mo||Lecture||Sarah||ntds-2019-05-v2.odp
|May 10 - Fr||Tutorial||Jun||ntds-tut-3|
|May 13 - Mo||Lecture||Sarah||ntds-2019-06-link-prediction.pdf
|May 17 - Fr||Lecture||Sarah|
|May 20 - Mo||Lecture||Sarah||ntds-2019-07-signed.pdf
|May 24 - Fr||Tutorial||Jun||ntds-tut-4|
|May 27 - Mo||Lecture||Sarah|
|May 31 - Fr||Lecture||Sarah|
|June 3 - Mo||Lecture||Sarah|
|June 7 - Fr||Tutorial||Jun|
|June 11 - Mo||No lecture / tutorial - public holiday|
|June 15 - Fr||No lecture / tutorial - public holiday|
|June 17 - Mo||Lecture||Sarah|
|June 21 - Fr||No lecture / tutorial|
|June 24 - Mo||Tutorial||Jun|
|June 28 - Fr||Lecture||Sarah|
|July 1 - Mo||Lecture||Sarah|
|July 5 - Fr||Tutorial||Jun|
|July 8 - Mo||Lecture||Sarah|
|July 12 - Fr||Lecture||Sarah|
|July 15 - Mo||Lecture||Sarah|
|July 19 - Fr||Q&A|