Percolation on Finite Graphs
Michael Krivelevich
Source abstract
Lecture notes from a graduate course given by Michael Krivelevich at the School of Mathematical Sciences of Tel Aviv University in the spring semester of 2026. Topics covered include: phase transition and the giant component in ; long paths and cycles in supercritical and sparse random graphs; thresholds for connectedness and perfect matching; general model of a random subgraph of a finite graph; phase transition and the giant component in the random hypercube; polynomial diameter of the giant component; perfect matchings in the random hypercube.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.