  We study, in the context of algorithmic randomness, the closed amenable
subgroups of the symmetric group $S_\infty$ of a countable set. In this paper
we address this problem by investigating a link between the symmetries
associated with Ramsey Fra\"iss\'e order classes and algorithmic randomness.
