Swedish web site
Modelling strange networks: algorithms and applications2015VT
|
|
Course plan
Lectures
6 lectures, and 6 examining seminars
Recommended for
Students with knowledge of basic graph theory, computer networks and mathematics who would like to learn more on information networks with a twist.
The course was last given
New course
Goals
After the course, the student will be able to:
* Understand and relate some advanced concepts of network theory
* Present, discuss and evaluate research results in the area
* Apply algorithmic methods for analysing network properties
* Implement and evaluate information propagation algorithms
Prerequisites
Basic graph theory
Computer networks
Organization
Lectures will present basic notions and introduce concepts. Advanced topics will be discussed in seminars where students read and present articles. Some hands on experience will be acquired through labs.
Contents
Graph metrics (connectivity, expansion, etc), Random graphs, Information spreading, Dynamic graphs, Epidemic algorithms, Percolation theory, Small-world networks, Wireless network models, P2P networks
Literature
Research papers
Lecturers
Mikael Asplund
Examiner
Mikael Asplund
Examination
Active attendance at seminars, presentation of some chosen article, completion of lab assignments
Credit
6 hp
Comments
Page responsible: Director of Graduate Studies
