Independence and the finite submodel property

We study a class C of ℵ0-categorical simple structures such that every M in C has an uncomplicated forking behavior and where definable relations in M which do not cause forking are independent in a sense that is made precise. The SU-rank of such M may be n for any natural number n> 0. The most well-known unstable structure in this class is the random graph, which has SU-rank one. The main result is that for every M in C, if a sentence ϕ is true in M then ϕ is true in a finite substructure of M. A probability theoretic argument is involved and it requires sufficient independence between relations which do not cause forking. A stable structure M belongs to C if and only if it is ℵ0-categorical, ℵ0-stable and every definable strictly minimal subset of M eq is indiscernible