Information for Random Graphs and Complex Networks (2WS12)
Lecturer:
Prof. dr. Remco van der Hofstad, HG 10.15, tel.040-2472910, rhofstad@win.tue.nl
Time and location: Tuesdays, 8:45-10:30 in HG 6.96,
and Wednesdays, 15:45-17:30 in Matrix 1.44.
See TU/e plattegrond
for the campus map.
Exam: Oral exam.
Course material: Lecture Notes: Random Graphs and Complex Networks.
Course material: Lecture notes.
Random Graphs and Complex Networks.
This is the final version
of the lectures notes that shall be used in the 2010 course.
Lecture days:
Week 1: February 2 and 3.
Week 2: February 9 and 10.
Week 3: February 23 and 24.
Week 4: March 2 and 3.
Week 5: March 9 and 10.
Week 6: March 16 and 17.
Week 7: March 23 and 24.
Week 8: March 30 and April 1.
Roughly one out of four lectures will be devoted to the exercises.
Course outline:
Week 1: Lectures 1 and 2: Introduction and Preliminaries (Chapters 1 and 2).
Transparencies First and Last Week (version January 29, 2010)
Exercises:
1.2, 2.8, 2.9, 2.11, 2.12, 2.13, 2.14, 2.15, 2.16, 2.17.
Week 2: Branching Processes (Chapter 3) and exercises.
Exercises:
3.1, 3.2, 3.3, 3.4, 3.9, 3.10, 3.11, 3.12, 3.13, 3.17, 3.26, 3.27, 3.28, 3.29, 3.30.
Week 3: Subcritical Erdös-Rényi Graphs (Sections 4.1-4.3).
Exercises:
4.1, 4.2, 4.3, 4.7, 4.8, 4.9, 4.10, 4.11, 4.12, 4.13.
Weeks 4 and 5: Supercritical Erdös-Rényi Graphs (Sections 4.4-4.6) and exercises.
Exercises:
4.14, 4.15, 4.16, 4.17, 4.18, 4.19, 4.23, 4.24.
Week 6:
Inhomogeneous random graphs (Chapter 6) and exercises.
Exercises:
6.1-6.12, 6.15, 6.17. 6.20.
Weeks 7 and 8:
Power Law Degree Sequences in Preferential Attachment Models (Chapter 8) and exercises.
Exercises:
8.1, 8.2, 8.3, 8.4, 8.5, 8.7, 8.8, 8.10, 8.11, 8.12, 8.13, 8.15, 8.16, 8.17.
Exercises: See lecture notes. Some of the exercises are worked out in the notes.