  Stability and dependence are model-theoretic notions that have recently
proved highly effective in the study of structural and algorithmic properties
of hereditary graph classes, and are considered key notions for generalizing to
hereditary graph classes the theory of sparsity developed for monotone graph
classes (where an essential notion is that of nowhere dense class). The theory
of sparsity was initially built on the notion of shallow minors and on the idea
of excluding different sets of minors, depending on the depth at which these
minors can appear.
  In this paper, we follow a similar path, where shallow vertex minors replace
shallow minors. In this setting, we provide a neat characterization of stable /
dependent hereditary classes of graphs: A hereditary class of graphs $\mathscr
C$ is
  (1) dependent if and only if it does not contain all permutation graphs and,
for each integer $r$, it excludes some split interval graph as a depth-$r$
vertex minor;
  (2) stable if and only if, for each integer $r$, it excludes some half-graph
as a depth-$r$ vertex minor.
  A key ingredient in proving these results is the preservation of stability
and dependence of a class when taking bounded depth shallow vertex minors. We
extend this preservation result to binary structures and get, as a direct
consequence, that bounded depth shallow vertex minors of graphs with bounded
twin-width have bounded twin-width.
