General
In this course, we will go through some of the more mathematical topics in network science. The aim is to develop skills in doing pen-and-paper
calculations and understanding the analytical methods that are most common in network science.
For lectures and exercise sessions, we use Zoom and for advice sessions we use Zulip. Only the lectures will be recorded and published publicly.
- Instructor: Mikko Kivelä, mikko.kivela@aalto.fi
- TA: Abbas K. Rizi, abbas.karimirizi@aalto.fi
Learning goals
- Knowledge of the most common mathematical methods in network science
- Improved skills for doing pen and paper calculations especially related to methods commonly used in network science
- Increased ability to justify the use of particular analytical techniques
- Increased confidence when reading more mathematical networks articles
Lecture topics
- Basic models and the typical approaches in network science
- Probability generating functions, Galton-Watson process, percolation threshold
- Component size distributions (using PGF’s)
- Network evolution models and processes on networks
- Exponential random graphs, block models
- Intro to the project
Pre-requirements
The students are expected to have completed the Complex Networks course (CS-E5740 - Complex Networks) and basic mathematics courses at Aalto or have at least equivalent background knowledge. Courses on stochastic processes or discrete mathematics can be useful but we do not expect the students to have taken any. The math that we need in this course can be found in the toolbox of calculus, probability theory, linear algebra, and graph theory.
Learning methods
- Learn by doing exercises!
Lots of hints and guidance: exercise seems very long. If you get stuck, ask for help.
- Lectures support exercises, not vice versa.
Exercises are published before lectures, start working on them immediately
- Project: make sense of a relatively recent research paper
Reading material
More mathematical approaches:
- Random Graphs and Complex Networks, R. van der Hofstad (2016-2017)
- A First Course in Network Theory, Ernesto Estrada and Philip A. Knight
Workload
The course does not have an exam, but passing and grading are based on returning 5 sets of homework assignments and the "final project" and participating in 5 homework sessions. There are also 6 lectures and a voluntary contact class every week where students can ask for advice on solving the problems. To get grade 1 the students are expected to successfully complete at least half of the exercises.
Grading
A grade between 0-5 is given to the students based on the returned homework problems and the project. In order for the homework problems to be graded the students must participate in the homework sessions and mark each problem they want to return as done. If the problem is marked as done the student is expected to be able to present it on the whiteboard.
Important Dates
URLZoom, Lectures and exercise sessions URL