Percolation Theory: FKG Inequality

Related lectures (32)

Page 2 of 4

Covers probabilistic methods in combinatorics, monochromatic edges, 2-colorable graphs, and good 2-colorings.

Explores Hertz theory for contact problems and the Tabor measurement method.

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Explores the construction of Ramanujan graphs using polynomials and addresses challenges with the probabilistic method.

Covers percolation theory and random graph models, exploring connectivity thresholds and critical power for wireless networks.

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores phase transitions through percolation in 2D networks.