Of Notes
Theory of Complex Networks
Table of Contents
6CCMCS02 / 7CCMCS02, Semester 1 2026-27. Part of MSc Complex Systems. Moodle: moodle/6CCMCS02 & 7CCMCS02 Theory of Complex Networks
Notes Index
- Basic Graph Theory
- The Small World Experiment
- Neighborhoods, Degrees and Connected Components
- Paths and Matrix Powers
- Triangles and the Clustering Coefficient
- Graph Distance
- Centrality
- Node Similarity
- Macro Analysis
Aims & learning outcomes
Self-contained introduction to the mathematical theory and analysis of complex networks and graphs. Students will be able to describe and analyse properties of complex systems with network theory.
Contents
- Application domains of complex networks
- Definitions and topological characteristics of networks, adjacency matrices
- Random graphs with imposed topological features (starting from the Erdos-Renyi model)
- Spectral properties of graphs, adjacency and Laplacian matrices
- Generating function methods
- More advanced topics (as time permits)
Assessment
100% closed-book written exam, 2hrs, Exam Period 2 (May-June) (December for students abroad). No calculators.
- Section A: 50% of marks, answer all questions
- Section B: all questions carry equal marks, only best TWO attempted count
- Examinable: lecture notes Chs. 2-6 (Ch. 1 not examinable; appendices are background only, not explicitly examined). Programming not required.
- Students abroad: no sections A/B, flat question list, Ch. 6 (random graphs) not examined.
- Past papers + solutions in Moodle (Assessment/Exam papers)
Reading list (open access)
- Alexander K. Hartmann & Martin Weigt, Introduction to Graphs: https://arxiv.org/abs/cond-mat/0602129
- Albert-Laszlo Barabasi, Network Science: http://networksciencebook.com/