On random relational structures

Erdős and Rényi gave a probabilistic construction of the countable universal homogeneous graph. We extend their result to more general structures of first-order predicate calculus. Our main result shows that if a class of countable relational structures C contains an infinite ω-categorical universal homogeneous structure U, then U can be constructed probabilistically.