A. J. Ganesh's Homepage

Complex Networks

Lecturer:

Ayalvadi Ganesh (a.ganesh@bristol.ac.uk)

Texts:

There is no set text but lecture notes will be provided online covering the course material. Additional reading, covering some of the course material in greater depth or from different perspectives can be found in:

Moez Draief and Laurent Massoulie, Epidemics and Rumours in Complex Networks, Cambridge University Press, 2009.

Devavrat Shah, Gossip Algorithms, NOW Publishers Inc., 2009.

Office hours: 4-5pm Tuesdays, Room 3.15, School of Mathematics.

Homework policy: Homework is an important part of learning the material on this course and you are strongly encouraged to attempt all the homework problems. All students are required to hand in solutions to selected problems. You may discuss the problems but you should write out the solutions on your own.

For those taking the course as a Level 3 course, the solutions will not count towards your final mark, but will affect whether you get credit for the course if your final mark is between 30 and 40. You will need to hand in satisfactory attempts to at least half the work to gain credit.

For those taking it as a Level M course, the solutions to selected problems that you hand in will count for 10% of your final mark. You will also be required to read a research paper and make a brief presentation about it. This will count for a further 10% of your final mark. You may choose one of the papers from the list below, or another paper of your choice relevant to the course, but discuss it with me first.