LEARNING OUTCOMES
A student who successfully completes the course will be able to: compute combinatorial quantities related to graphs, define and use centrality measures to rank nodes in a graph, know basic spectral properties of adjacency matrices, apply matrix theoretical tools to clustering problems for a network.
Credits: 5
Schedule: 01.11.2021 - 09.12.2021
Teacher in charge (valid for whole curriculum period):
Teacher in charge (applies in this implementation): Vanni Noferini, Ryan Wood
Contact information for the course (applies in this implementation):
CEFR level (valid for whole curriculum period):
Language of instruction and studies (applies in this implementation):
Teaching language: English. Languages of study attainment: English
CONTENT, ASSESSMENT AND WORKLOAD
Content
valid for whole curriculum period:
Review of basic graph theory, spectral theory for adjacency matrix and graph Laplacian, centrality measures, deformed graph Laplacian, spectral clustering.
Assessment Methods and Criteria
valid for whole curriculum period:
Either written exam or project+presentation (student's choice)
Workload
valid for whole curriculum period:
19 hours lectures, 5 hours exercises, 120 hours individual study
DETAILS
Study Material
valid for whole curriculum period:
Primarily lecture notes. Further suggested reading material (e.g. books) will be provided during the lectures.
Substitutes for Courses
valid for whole curriculum period:
Prerequisites
valid for whole curriculum period:
FURTHER INFORMATION
Further Information
valid for whole curriculum period:
Teaching Period:
(2020, 2021) - No teaching
2021-2022 Autumn II
Course Homepage: https://mycourses.aalto.fi/course/search.php?search=MS-E1052
Registration for Courses: In the academic year 2021-2022, registration for courses will take place on Sisu (sisu.aalto.fi) instead of WebOodi.
Via WebOodi