We prove a number of results in effective randomness, using methods in which effectively closed sets play an essential role. The results proved include the fact that every PA Turing degree is the join of two Martin-Löf random Turing degrees, and the existence of a minimal pair of LR degrees below the LR degree of the halting problem.