The lecture gives an introduction to the analysis of networks. It includes theoretical foundations of social networks (definitions, representation as a graph, local structures), elementary graph algorithms (shortest path, clustering coefficient, ...), centrality measures for social networks (PageRank, betweenness centrality, ...), methods for community detection, phenomena in empirical social networks (scale-free networks, small-world phenomenon, homophilia, ...), graph models (random graphs, preferential attachment,...), robustness of graphs, as well as dynamics in networks, epidemics and information cascades.
Knowledge: Upon successful completion of this module, students will have developed an understanding of basic concepts and algorithms for analyzing networks and have acquired knowledge of empirically occurring phenomena in networks. Furthermore, the students get an overview of current analysis tools of social networks.
Skills: The students learn how to analyze empirical social networks with regard to their structure and mathematical properties such as the determination of central nodes, as well as methods to understand dynamics in social networks. In addition, the students learn how to use the most common program libraries for analyzing social networks.
Competences: The students should be able to effectively use analysis methods for social networks in other areas of application.
Basic knowledge of algorithms and data structures as well as programming concepts and methods, practical programming skills (Python), basic knowledge of statistics”.
|Forms of teaching and learning||Contact hours||Independent study time|
|Lecture||2 SWS||7 SWS|
|Exercise class||2 SWS||6 SWS|
|Form of assessment||Written exam (80 minutes)|
Prof. Dr. Markus Strohmaier
Prof. Dr. Markus Strohmaier, Marlene Lutz
|Duration of module||1 semester|
|Range of application||M.Sc. MMM, M.Sc. Bus. Edu., M.Sc. Econ., M.Sc. Bus. Inf., MMDS|
|Preliminary course work||Students must pass at least 50% of the written assignments in the exercise class in order to take the final exam|
|Literature||David Easley and Jon Kleinberg's Networks, Crowds, and Markets.|
Laszlo Barabasi's Network Science
Aaron Clauset's course notes on Network Analysis and Modeling
Stanley Wasserman and Katherine Faust's Social Network Analysis: Methods and Applications
Mark Newman's Networks: An Introduction
|Course outline||The lecture is divided into an introduction to basic concepts of networks, models of networks, mesoscopic structures, temporal networks and network dynamics.|