Property Testing

Suppose you are given a sparse directed graph on $n$ vertices with a maximum degree at most $d$ and a parameter $\epsilon \in [0,1]$. We wish to design a testing algorithm that accepts (with probabili...