I will discuss bounded degree expander graphs that are expanders both globally and locally. Namely, they are expanders in the usual sense, but the neighborhood of every vertex is also a very good expander. Random bounded degree graphs are not such. I will discuss the usefulness of such objects for a strong form of local testability of codes.
Based on a joint work with Irit Dinur and Noga Ron-Zewi.