  We introduce and study analogues of expander and hyperfinite graph sequences
in the context of directed acyclic graphs, which we call "extender" and
"hypershallow" graph sequences, respectively. Our main result is a
probabilistic construction of non-hypershallow graph sequences.
