Expander graphs are sparse graphs with strong connectivity — information spreads fast. The spectral gap λ₁ − λ₂ of the adjacency matrix measures expansion. Ramanujan graphs achieve the optimal bound: λ₂ ≤ 2√(d−1) (Alon–Boppana). This lab shows random walk mixing on different graph types and displays their eigenvalue spectrum.