The spectral gap theorem says that a \(k\)-regular graph on \(n\) vertices can be approximated by a random graph with edge density \(k/n\), where the error term is controlled by the second largest eigenvalue of the adjacency matrix. We discuss several applications of this theorem to various problems in arithmetic and geometric combinatorics in the finite field setting.