 Algebraic and definable closure in the random graph

For every small set $A$ in a monster random graph,Any vertex outside $A$ has infinitely many conjugates over $A$ with the same adjacency pattern.