Epidemics and Bootstrap Percolation in Square Lattice

Related lectures (31)

Page 1 of 4

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

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

Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.

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

Covers bond percolation on a square lattice, discussing percolation phases, critical threshold, mean cluster size, and critical point scenarios.

Explores phase transitions through percolation in 2D networks.

Explores moment generating functions and multivariate normal distributions in probability and statistics.