Complex Network Analysis (2V+1U, 4.0 LP)
|SWS||Type||Course Form||CP (Effort)||Presence-Time / Self-Study|
|-||K||Lecture with exercise classes (V/U)||4.0 CP||78 h|
|1||U||Exercise class (in small groups)||14 h|
|(2V+1U)||4.0 CP||42 h||78 h|
|CP, Effort||4.0 CP = 120 h|
|Position of the semester||1 Sem. in WiSe|
|Level|| Bachelor (Specialization)|
|Language||[DE/EN] German or English as required|
|Area of study||[INF-SI] Socioinformatics|
Possible Study achievement
- Verification of study performance: proof of successful participation in the exercise classes (ungraded)
- Details of the examination (type, duration, criteria) will be announced at the beginning of the course.
- Introduction: small-worlds, network motifs, graph mining, and the Königsberger bridge problem.
- Graph theoretical definitions Network models and random graphs
- Project design in network analysis
- Centrality measures
- Clustering algorithms I + II
- Algorithms for network motifs
- One-mode projections of bipartite graphs
- Machine learning in network analysis
- U. Brandes, T. Erlebach: Network analysis – methodological foundations, Springer Verlag, 2005.
- D. Easley and J. Kleinberg: Networks, Crowds, and Markets, Cambridge University Press, 2010.
- Katharina A. Zweig: Network Analysis Literacy, Springer Verlag, Wien, 2016
Requirements for attendance (informal)
- [INF-02-06-K-2] Algorithms and Data Structures (4V+2U, 8.0 LP)
- [MAT-02-12-K-1] Mathematics for Computer Science Students: Combinatorics, Stochastics, and Statistics (4V+2U, 8.0 LP)