  Expander graphs in general, and Ramanujan graphs in particular, have been of
great interest in the last three decades with many applications in computer
science, combinatorics and even pure mathematics. In these notes we describe
various efforts made in recent years to generalize these notions from graphs to
higher dimensional simplicial complexes.
