Majority dynamics on sparse random graphs, with Ashwin Sah: paper, proof atlas, full Lean formalization.
N people hold random opinions; one side leads by ~√N. Each day, everyone adopts the majority among their neighbors. With average degree N^ε, that lead wins in O(1/ε) days.