6.268 Network Science and Models
Spring 2017
Professor: Patrick Jaillet
TA: Max Burq
Lecture: TR9.30-11 (4-149)
Information:
Introduces the main mathematical models used to describe large networks and dynamical processes that evolve on networks. Static models of random graphs, preferential attachment, and other graph evolution models. Epidemic propagation, opinion dynamics, and social learning. Applications drawn from social, economic, natural, and infrastructure networks, as well as networked decision systems such as sensor networks.
For more information click here for the current course description.
Announcements
Project Presentations
Here’s a couple details regarding the project presentations next week. Single-person projects will have 5 minutes and pairs will have 10 minutes. This is quite short so you should focus on the main elements of your projects, and keep the details for the report.
In order to speed-up transitions between presentations, everyone (regardless of the day of presentation) should send me their slides (.ppt or .pdf, no weird formats) via email by Monday 05/15 at 8pm at the latest.
The presentation schedule will be as follows:
Tuesday:
- Bishop
- Morse
- Rueda Guerrero
- Foley / Jakobsen
- Siderius
- Tay
- Yang
- Jin / Sun
Thursday:
- Chodrow
- Jahani
- Qin
- Baek / Romanski
- Shi
- Soylenezoglu
- Wen
- McBride / Shah
Announced on 14 May 2017 1:00 a.m. by Max Burq
no class tomorrow + project group confirmation
Hi all,As discussed in class on Tuesday as an option, and from what I heard afterwards, there will be no class tomorrow so that everyone can concentrate on thrir projects. The subject of the class was an overview of what was covered in the semester, plus pointers to what next for those interested in pursuing some of these topics. We will upload that information on stellar later. Also please send us by the end of today the confirmation of your project and group. Thanks,
--pj
Announced on 10 May 2017 3:48 p.m. by Patrick Jaillet
HW5 Pb2 erratum
As has been pointed out to me, for problem 2b) we consider a path from i to j of length n-1. Such a path may not exist, however there always exists a path of length k <= n-1, which is enough to answer the question.
Also a hint for those who are not familiar with Cauchy-Schwarz's inequality: you can assume that for any non-negative sequences a_i and b_i (1 <= i <= k), we have (sum_i a_i * b_i)^2 <= (sum_i a_i^2 ) *(sum_i * b_i^2).
Best,
Max.
Announced on 26 April 2017 1:46 p.m. by Max Burq
Midterm details + office hours
Hi all,A reminder that the midterm exam will be this Wednesday April 12, from 7pm until 9pm in 32-144. This is a closed-book, closed- notes exam, but you can bring one double-sided page of hand-written or typed notes. Topics covered include the materials included in the Lecture notes 1 to 12.
Max has office hours on Monday at 4pm. I will also keep the time slot 11am until 12pm, on Tuesday April 11 (after lecture) open for office hours in my office 32-D624.
Best,
--pj
Announced on 09 April 2017 9:47 p.m. by Patrick Jaillet
Edit: Office Hours at 4pm on Monday
Best,
Max.
Announced on 07 April 2017 2:52 p.m. by Max Burq
