Lecturer: Dr. Rik Sarkar
Network analysis comes up in many domains and is currently a fast developing topic. This course covers some of the mathematical and computational foundations for understanding networks. It also studies some recent developments and research in this area.
The aim of the course is to teach basic techniques for analyzing networks, designing and analyzing network algorithms and presenting your understanding in a formal way.
Pre-requisites are: Understanding (undergraduate level) of graphs, data structures, basic algorithms (spanning trees, BFS, DFS, sorting etc), Linear algebra, and probability.
Revision class: Monday 18 April, 9AM, LG11, David Hume Tower
Some sample questions are available. See email.
No class on Tuesday 24. Final class on Friday 27.*
Final Project submission instructions and tips are here
Solutions to Lecture 3 & 4 are up.
Instructions for project plan/proposal: here
Lecture notes for Lectures 5 and 6: Small worlds, is online (see below).
Please join the Piazza forum: https://piazza.com/ed.ac.uk/fall2015/infr11124
Projects are out! See your email.
No class on Friday 23rd
In Lecture 2 we will prove properties of random graphs. Please bring pen and paper to take notes.
First class is on Tuesday, September 22
Test your background: Read Chapter 2 or chapter 7 of David Kempe - Structure and dynamics of information in networks and see that you are comfortable with it.
Small World models: Combined with 6 below
Recent papers. These will be given along with relevant lecture materials.
Final theory exam: 60% of marks. One Project 40% of marks. The project will consist of using programming and existing network analysis tools, develop and implement algorithms, perform analysis on networks etc.
FEEDBACK: Assignment scores and comments on deduction of marks. Exercise theoretical problems and solutions will be given in class. Please use these to test your understanding and your precision in writing analytic answers.
DRPS page of the course.