Course Identification

Title:

Percolation

Code:

20264041

Lecturers and Teaching Assistants

Lecturers:

Prof. Gady Kozma

TA's:

N/A

Course Schedule and Location

Year:

2026

Semester:

First Semester

When / Where:

Wednesday, 11:00 - 13:00, WSoS, Rm C

First Lecture:

29/10/2025

End date:

21/01/2026

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Lecture; Elective; Regular; 2.00 points

Comments

N/A

Prerequisites

No

Restrictions

Participants:

250

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Pass / Fail

Grade Breakdown (in %)

Final:

100%

Evaluation Type

Take-home exam

Scheduled date 1

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

3

Syllabus

- Correlation inequalities
- The theorem of Menshikov-Aizenman-Barsky,
- 2d percolation and Russo-Seymour-Welsh theory
- p_c=1/2, renormalisation
- Percolation on groups

Learning Outcomes

Uppon successful completion of this course students will be able to:
[1] Demonstrate good knowledge and understanding of percolation

Reading List

Grimmett: Percolation.

Lyons & Peres: Probability on trees and networks, chapters 7-8.

Garban & Steif: Noise Sensitivity of Boolean Functions and Percolation.

Heydenreich & van der Hofstad: Progress in high-dimensional percolation and random graphs.

Werner: Random planar curves and Schramm-Loewner evolutions, chapter 10 (Saint-Fluor lecture notes or arXiv:0303354)

Bollobas & Riordan: Percolation

Website

N/A