Lecturer: Kjell J. Hole, Professor, Department of Informatics, University of Bergen.
Lectures: 12 weeks with two sessions per week and 1.5 hours per session.
Syllabus: Spring 2015 (PDF)
Lecture notes: Dynamical processes on complex networks and three case studies: maintaining trust in e-government, halting malware epidemics, and lack of privacy on the Internet.
Assignments: Programing of dynamic network models and visualization of networks.
Tools: NetLogo and Gephi.
Contents: This course introduces mathematical theory, agent-based simulation tools, and interactive visualization software to analyze dynamical processes on large networks.
Topics covered include random graphs, the small-world model, and the preferential attachment model; cellular automata models; algorithms to evaluate network properties; experimental studies; and evolutionary game theory.
The course studies large-impact, hard-to-predict, and rare (LHR) events in complex adaptive systems, explains why LHR events are hard to predict using traditional techniques for risk analysis, and considers how to build Information and Communications Technology (ICT) systems that limit the impact of potential LHR events.
The course is based on material found in the textbooks on the right and articles posted on the bulletin board. Required reading must be done before class. In-class time will be divided between lectures, discussions, and programming exercises.
Recommended qualifications: Basic knowledge of graphs and some familiarity with programming.
Last updated 30.03.15.