In combinatorics, an expander graph is a sparse graph which has high connectivity properties. Expander constructions have spawned research in pure and applied mathematics, with several applications to theoretical computer science, design of robust computer networks, and the theory of error-correcting codes. I will discuss some techniques from differential geometry and partial differential equations that have been applied to study expansion properties of graphs.