Sorry, but the limit for this course is reached (13 students)!
You cannot register for this course anymore.

News

Currently, no news are available

Seminar description

In this seminar, we will explore several fundamental models of random graphs and examine their key properties.

Topics may include the Erdős–Rényi model, the preferential attachment model, the formation of a giant component, and measures such as average distance and network diameter.
 


Prerequisites:  a solid understanding of fundamental concepts in real analysis and probability theory

Target Audience:  Students enrolled in Mathematics, Mathematics and Computer Science, or Computer Science programs
 


Registration

To participate in the seminar, please register until 29 March 2026, 23:59.
 


First Meeting

Time:  Wednesday, 8 April 2026, 10:15

Location:  seminar room 6, building E2 4

Privacy Policy | Legal Notice
If you encounter technical problems, please contact the administrators.