Spring 2005
|
Information Networks Spring 2005 |
| Home Announcements Homework Reading List References Datasets and Code Interesting Links |
Administrative Course
Code: 582474
Instructor: Panayiotis Tsaparas Tutor: Evimaria Terzi Language: English Time: March 8 - May 12, Tue, Thus 14 - 16 Lecture Room: Kumpula campus, Exactum bldg, Room DK117 Office Hours: Panayiotis, Tuesday 16:00 - 17:00, Room A347 Evimaria, Thursday 16:00- 17:00, Room A346 Mailing list: [email protected] (for announcements and for posting questions) Overview In this course we
will study models and algorithms for information
networks. The
course will be modeled after similar courses by Jon
Kleinberg, The
Structure
of
Information Networks, Algorithms
for
Information Networks. We will study networks
such as the
Web, the internet, social networks and biological
networks. The
objective is to see the common structure and properties
that underlie
these networks, and study algorithms that make use of
this structure
for tasks such as ranking, information propagation,
epidemic
containment.
Course HomeworkIt is assumed that the students that take this course have a good grasp of mathematics, and in particular graph theory, probabilities, and some linear algebra. For the project you will be most likely required to do some programming. The
course homework consists of assignments, and a project.
There will be
at least two, and no more than three assignments. There
will be either
a reaction paper, an exercise set, or a presentation
(click here
for more info on that), depending on the attendance and
the material.
The final grade will be determined 50% by
the grade on the project and 50% by the grade on the
assignments.
If there are three assignments, the project may
become 40% of the grade.
There will be no fixed exercise session time, but when required Evimaria will host tutorials on Mondays, 14:00 - 16:00 pm Reading material, references and handouts The
goal of the course is to go through a collection of recent
research
papers on models and algorithms for complex networks. A
(constantly changing) list of papers can be found here.
The list is
indicative of the topics that will be covered. Not all
papers will be
presented in class.
Teaching will be done using both slides and blackboard, depending on the topic. Slides and references will be made available on the Web page at the references page. |
Announcements The latest
announcements will be posted here. All announcements can
be found at
the announcements page
April 24:Some more papers were added to the presentation list today. Make sure that you send me the paper that you want to present as soon as possible. |