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 

 

Location: Paviljoen L.10. See TU/e plattegrond for the campus map. The Paviljoen building is indicated by PAV on the map.
 

Time: Wednesdays, 8:45-10:30.

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 during this year's course.

 

 

Lecture days:

 

 

Dates are: February 4 and 11, March 4, 18 and 25, April 1, 8, 15 and 22.

The lecture of February 18 is moved to March 30, 9:00-11:45 in LG 1.105.

 

 

Course outline:

Week 1: Introduction and Preliminaries (Chapters 1 and 2).

 

Transparencies First and Last Week (version February 3, 2009)

 

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).

 

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 and 4: 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.

Week 5 and 6: Supercritical Erdös-Rényi Graphs (Sections 4.4-4.6).

 

Exercises: 4.14, 4.15, 4.16, 4.17, 4.18, 4.19, 4.23, 4.24.

Week 6: Critical Erdös-Rényi Graphs and Connectivity Transition (Sections 5.1 and 5.2).

 

Exercises: 5.1, 5.2, 5.3.

Week 7: Inhomogeneous random graphs and Degree Sequences (Chapter 6).

 

Exercises: 6.1-6.12, 6.15, 6.17. 6.20.

Week 8 and 9: Power Law Degree Sequences in Preferential Attachment Models (Chapter 8).

 

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.

Week 10: Average Distances in GRG and CM (Chapters 9--11).

 

Exercises: 10.1, 10.2.

 

Exam:

Oral exam.

 

 

Exercises:

See lecture notes. Some of the exercises are worked out in the notes.