Percolation Theory: FKG Inequality

Related lectures (49)

Covers percolation theory, absorbed polymers, giant molecules, phase transition, scaling assumptions, and universal behavior in percolation models.

Explores phase transitions through percolation in 2D networks.

Covers topics in probability theory, focusing on uniform integrability and convergence theorems.

Explores independence in infinite coin tosses, covering sets, shifts, and T-invariance.

Covers thermodynamic concepts and exam questions from 2012, 2013, and 2015.

Introduces cardinality and mapping in linear algebra, illustrating concepts with examples and visual aids.

Covers GFF convergence and the six vertex model's phase transitions.

Covers the transition from the six-vertex model to FK-percolation, focusing on critical phenomena and phase transitions in two-dimensional systems.

Covers the Poisson Paradigm, including the First/Second Moment Method and Martingales, discussing dependency graphs and Chernoff bounds.

Explores the theory of martingales, including conditional expectations, Chernoff bounds, and Azuma's inequality.

Explores Markov's theorem, Chernoff bound, and probability theory fundamentals, including good coloring, 2-colorable graphs, and rare events.

Explores the Poisson Paradigm and dependency measures in ordered pairs and graphs.

Explores interlacing polynomials, real rooted theorems, and pseudo-probabilistic methods in polynomial analysis.

Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.

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

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

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

Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.

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

Explores zero-sum games and the minimax theorem in Game Theory, emphasizing optimal strategies.

Page 1 of 3